[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 fwsim-tau-othertid (conclusion) (back to tree)

DMSQGInv(gs), DMSQLInv(gs, ls, pc), DMSQLInv(gs, ls0, pc0), ls.tid ≠ ls0.tid, absls(gs, ls0, pc0, als), pre(gs, ls, pc, τ) ⊦ abspc(gstepf(gs, ls, pc, τ), ls0, pc0) = abspc(gs, ls0, pc0) ∧ absls(gstepf(gs, ls, pc, τ), ls0, pc0, als)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof fwsim-tau-othertid (previous step) (back to tree)

ls.tid ≠ ls0.tid, DMSQGInv(gs), DMSQLInv(gs, ls0, pc0), DMSQLInv(gs, ls, pc), absls(gs, ls0, pc0, als), pre(gs, ls, pc, τ) ⊦ abspc(gstepf(gs, ls, pc, τ), ls0, pc0) = abspc(gs, ls0, pc0) ∧ absls(gstepf(gs, ls, pc, τ), ls0, pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ abspc(gs, ls, pc) = abspc(gs0, ls0, pc) ↔ (pc = E4 ⊃ ls.success ↔ ls0.success ;(pc = E10 ⊃ ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ↔ ls0.success → ls0.lst = gs0.vtail ∧ gs0.ps[ls0.lst].next = null ;(pc = E11 ⊃ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ↔ ls0.lst = gs0.vtail ∧ gs0.ps[ls0.lst].next = null ;(pc = D6 ⊃ ls.success ↔ ls0.success ;(pc = D20 ⊃ ls.success → gs.ps[ls.nxt].deqID = None ↔ ls0.success → gs0.ps[ls0.nxt].deqID = None ;(pc = D21 ⊃ gs.ps[ls.nxt].deqID = None ↔ gs0.ps[ls0.nxt].deqID = None ;true ) ) ) ) ) ); (s)

Proof step 3 from proof fwsim-tau-othertid (previous step) (back to tree)

ls.tid ≠ ls0.tid, DMSQGInv(gs), DMSQLInv(gs, ls, pc), DMSQLInv(gs, ls0, pc0), absls(gs, ls0, pc0, als), pre(gs, ls, pc, τ) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ ls0.success → ls0.lst = gstepf(gs, ls, pc, τ).vtail ∧ gstepf(gs, ls, pc, τ).ps[ls0.lst].next = null ↔ ls0.success → ls0.lst = gs.vtail ∧ gs.ps[ls0.lst].next = null ;(pc0 = E11 ⊃ ls0.lst = gstepf(gs, ls, pc, τ).vtail ∧ gstepf(gs, ls, pc, τ).ps[ls0.lst].next = null ↔ ls0.lst = gs.vtail ∧ gs.ps[ls0.lst].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ ls0.success → gstepf(gs, ls, pc, τ).ps[ls0.nxt].deqID = None ↔ ls0.success → gs.ps[ls0.nxt].deqID = None ;pc0 = D21 → (gstepf(gs, ls, pc, τ).ps[ls0.nxt].deqID = None ↔ gs.ps[ls0.nxt].deqID = None) ) ) )) ∧ absls(gstepf(gs, ls, pc, τ), ls0, pc0, als)

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] → [val, vhead1, optval0, vhead, nd, ls, addr, tid, vhead0, vhead2, rvref, tid0, obsEmpty, 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 4 from proof fwsim-tau-othertid (previous step) (back to tree)

ls = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), tid ≠ ls0.tid, DMSQGInv(gs), DMSQLInv(gs, ls0, pc0), DMSQLInv(gs, ls, pc), absls(gs, ls0, pc0, als), pre(gs, ls, pc, τ) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ ls0.success → ls0.lst = gstepf(gs, ls, pc, τ).vtail ∧ gstepf(gs, ls, pc, τ).ps[ls0.lst].next = null ↔ ls0.success → ls0.lst = gs.vtail ∧ gs.ps[ls0.lst].next = null ;(pc0 = E11 ⊃ ls0.lst = gstepf(gs, ls, pc, τ).vtail ∧ gstepf(gs, ls, pc, τ).ps[ls0.lst].next = null ↔ ls0.lst = gs.vtail ∧ gs.ps[ls0.lst].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ ls0.success → gstepf(gs, ls, pc, τ).ps[ls0.nxt].deqID = None ↔ ls0.success → gs.ps[ls0.nxt].deqID = None ;pc0 = D21 → (gstepf(gs, ls, pc, τ).ps[ls0.nxt].deqID = None ↔ gs.ps[ls0.nxt].deqID = None) ) ) )) ∧ absls(gstepf(gs, ls, pc, τ), ls0, pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof fwsim-tau-othertid (previous step) (back to tree)

tid ≠ ls0.tid, DMSQGInv(gs), DMSQLInv(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc), DMSQLInv(gs, ls0, pc0), absls(gs, ls0, pc0, als), pre(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ ls0.success → ls0.lst = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[ls0.lst].next = null ↔ ls0.success → ls0.lst = gs.vtail ∧ gs.ps[ls0.lst].next = null ;(pc0 = E11 ⊃ ls0.lst = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[ls0.lst].next = null ↔ ls0.lst = gs.vtail ∧ gs.ps[ls0.lst].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ ls0.success → gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[ls0.nxt] .deqID = None ↔ ls0.success → gs.ps[ls0.nxt].deqID = None ; pc0 = D21 → ( gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[ls0.nxt] .deqID = None ↔ gs.ps[ls0.nxt].deqID = None) ) ) )) ∧ absls(gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), ls0, pc0, als)

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] → [val0, vhead5, optval2, vhead3, nd0, ls0, addr0, tid1, vhead4, vhead6, rvref0, tid2, obsEmpty0, 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: value, nxt, optval1, node, nd0, ls0, addr0, tid1, lst, first, rvref0, othertid, success, optval1

Proof step 6 from proof fwsim-tau-othertid (previous step) (back to tree)

ls0 = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), tid ≠ tid1, DMSQGInv(gs), DMSQLInv(gs, ls0, pc0), DMSQLInv(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc), absls(gs, ls0, pc0, als), pre(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead4].next = null ↔ obsEmpty0 → vhead4 = gs.vtail ∧ gs.ps[vhead4].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead4].next = null ↔ vhead4 = gs.vtail ∧ gs.ps[vhead4].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ obsEmpty0 → gs.ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ gs.ps[vhead5].deqID = None) ) ) )) ∧ absls(gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), ls0, pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof fwsim-tau-othertid (previous step) (back to tree)

tid ≠ tid1, DMSQGInv(gs), DMSQLInv(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc), DMSQLInv(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), pre(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ obsEmpty0 → vhead4 = gs.vtail ∧ gs.ps[gs.vtail].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ vhead4 = gs.vtail ∧ gs.ps[gs.vtail].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ obsEmpty0 → gs.ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ gs.ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, mkls (tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc], <all paths>

Additional information

Used terms: gs, mkls (tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc

Proof step 8 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 9 from proof fwsim-tau-othertid (previous step) (back to tree)

tid ≠ tid1, DMSQGInv(gs), DMSQLInv(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), pre(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), pc = D3 → gs.rvowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref) = Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∈ gs.vrvHp ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∈ gs.prvHp ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ≠ null, pc = D4 → gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∈ gs.vrvHp ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∈ gs.prvHp ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ≠ null, pc = D5 → gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = D6 → ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = gs.vrvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref] ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = gs.prvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref]) ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Empty ∨ ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ⊃ Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ;Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val) ), pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first, pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst, pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next) ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ≠ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next), pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next) ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ≠ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next), pc = D12 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next), pc = D13 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = null, pc = D14 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref] = Empty ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = null, pc = D15 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref] = Empty ∧ gs.prvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref] = Empty, pc = D16 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null, pc = D17 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null, pc = D18 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next, pc = D19 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Val(gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].val), pc = D20 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Val(gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) → gs.vhead = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success) ∧ (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ⊃ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val) ∧ ( gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID = None → gs.vhead = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first) ∧ noid (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.orl + gs.qrl, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt, gs.vs) ; gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ noid (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.orl + gs.qrl, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first, gs.vs) ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ), pc = D21 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ ( gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID = None → gs.vhead = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first) ∧ noid (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.orl + gs.qrl, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) → gs.vhead = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first), pc = D22 → gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next, pc = D23 → gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = gs.vrvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref], pc = D24 → gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = gs.vrvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref] ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = gs.prvHp[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref], pc = D25 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Val(gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].val) ∧ ( gs.vhead = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first → gs.rvowns (gs.vretRefs((gs.ps ⊕ gs.vs)[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID.tid)) = Claimed ((gs.ps ⊕ gs.vs)[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID.tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val)), pc = D26 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Val(gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].val) ∧ ( gs.vhead = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first → gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid)) = Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val)), pc = D27 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid) ∧ ( gs.vhead = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first → gs.rvowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).addr) = Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val)), pc = D28 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid) ∧ gs.rvowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).addr) = Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val), pc = D29 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ gs.rvowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).addr) = Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val), pc = D30 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next ∧ gs.rvowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).addr) = Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).othertid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val), pc = D31 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].deqID ≠ None ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first].next, pc = D34 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = gs.vrvHp[gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)] ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = gs.prvHp[gs.pretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)] ∧ gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) = gs.pretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∈ gs.vrvHp ∧ gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ≠ null ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Empty ⊃ Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ;Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val) ), pc = E2 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = E3 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = E5 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = E6 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ ( gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = null → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst = gs.vtail), pc = E7 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next) ∧ ( gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = null → gs.vtail = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst), pc = E8 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next) ∧ ( gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = null → gs.vtail = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst), pc = E9 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ ( gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = null → gs.vtail = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst), pc = E10 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success → gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ≠ null ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node].val = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).value ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst = gs.vtail ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = null ∧ gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Weak(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∨ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node), pc = E11 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ≠ null ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node].val = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).value ∧ ( mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst = gs.vtail ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = null ∧ gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Weak(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∨ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node), pc = E12 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.orl + gs.qrl ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.ps ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.vs ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ≠ null, pc = E13 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = E14 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null, pc = E15 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt = gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt ≠ null, pc = E16 → gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.ps ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.vs ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ≠ null ∧ ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.orl ∧ ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.qrl, pc = E4 ∨ pc = E10 → ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success → ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.orl ∧ ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.qrl ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.ps ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node ∈ gs.vs ∧ gs.owns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node) = Some(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∧ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node] = mk(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).value, None, null) ∧ gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node] = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node] = mk(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).value, None, null), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node] = gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node], pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = Pending(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first ≠ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∧ gs.vtail ∈ gs.orl + gs.qrl from mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst, pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst ∈ gs.orl + gs.qrl from mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first, pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∧ gs.pretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) = mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ∈ gs.vrvHp ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).rvref ≠ null, pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ∧ gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ∈ gs.vrvHp ∧ gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid) ≠ null ∧ gs.rvowns(gs.vretRefs(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid)) = Claimed (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval.val) ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Val(gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].val), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).addr ∈ gs.vrvHp ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).addr ≠ null ∧ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).optval = Val(gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt].val), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.vhead, gs.vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first → nextnottid(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.vhead, gs.vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.orl + gs.qrl, gs.vhead, gs.vs), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.orl + gs.qrl, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).first, gs.vs), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.orl + gs.qrl, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).nxt, gs.vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.owns), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node, gs.owns, gs.vs, gs.ps), pc = E10 → (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ⊃ ( gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ≠ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ⊃ oneweakowns (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node, gs.owns, gs.vs, gs.ps) ;noowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.owns) ) ;oneowns (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node, gs.owns, gs.vs, gs.ps) ), pc = E11 → ( gs.ps[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ≠ gs.vs[mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).lst].next ⊃ oneweakowns (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node, gs.owns, gs.vs, gs.ps) ;noowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.owns) ), pc = E4 → (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).success ⊃ noowns(mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, gs.owns) ;oneowns (mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).tid, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr).node, gs.owns, gs.vs, gs.ps) ) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ obsEmpty0 → vhead4 = gs.vtail ∧ gs.ps[gs.vtail].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ vhead4 = gs.vtail ∧ gs.ps[gs.vtail].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ obsEmpty0 → gs.ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ gs.ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ retDEQ(tid, optval) ≠ τ; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ pre(gs, ls, D34, a) ↔ a = retDEQ(ls.tid, ls.optval); (s) ⊦ D14 ≠ D34; (s) ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .othertid = tid0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .addr = rvref0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s)

Proof step 10 from proof fwsim-tau-othertid (previous step) (back to tree)

pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQGInv(gs), DMSQLInv(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), pre(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), pc = E2 → gs.owns(vhead) = Some(tid), pc = E3 → gs.owns(vhead) = Some(tid), pc = E5 → gs.owns(vhead) = Some(tid), pc = E6 → gs.owns(vhead) = Some(tid) ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ (gs.ps[vhead0].next = null → vhead0 = gs.vtail), pc = E7 → gs.owns(vhead) = Some(tid) ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ (vhead1 ≠ null → vhead1 = gs.vs[vhead0].next) ∧ (gs.vs[vhead0].next = null → gs.vtail = vhead0), pc = E8 → gs.owns(vhead) = Some(tid) ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ (vhead1 ≠ null → vhead1 = gs.vs[vhead0].next) ∧ (gs.vs[vhead0].next = null → gs.vtail = vhead0), pc = E9 → gs.owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ (gs.vs[vhead0].next = null → gs.vtail = vhead0), pc = E10 → obsEmpty → gs.vs[vhead0].next = vhead ∧ gs.vs[vhead0].next ≠ null ∧ gs.vs[gs.vs[vhead0].next].val = val ∧ ( vhead0 = gs.vtail ∧ gs.ps[gs.vtail].next = null ∧ gs.owns(gs.vs[gs.vtail].next) = Weak(tid) ∨ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ gs.ps[vhead0].next = gs.vs[vhead0].next), pc = E11 → obsEmpty ∧ gs.vs[vhead0].next = vhead ∧ gs.vs[vhead0].next ≠ null ∧ gs.vs[gs.vs[vhead0].next].val = val ∧ ( vhead0 = gs.vtail ∧ gs.ps[gs.vtail].next = null ∧ gs.owns(gs.vs[gs.vtail].next) = Weak(tid) ∨ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ gs.ps[vhead0].next = gs.vs[vhead0].next), pc = E12 → obsEmpty ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ (gs.vs[vhead0].next ∈ gs.orl ∨ gs.vs[vhead0].next ∈ gs.qrl) ∧ gs.vs[vhead0].next = vhead ∧ gs.ps[vhead0].next = gs.vs[vhead0].next ∧ gs.vs[vhead0].next ∈ gs.ps ∧ gs.vs[vhead0].next ∈ gs.vs ∧ gs.vs[vhead0].next ≠ null, pc = E13 → gs.owns(vhead) = Some(tid), pc = E14 → gs.owns(vhead) = Some(tid) ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ vhead1 = gs.vs[vhead0].next ∧ gs.vs[vhead0].next ≠ null, pc = E15 → gs.owns(vhead) = Some(tid) ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ vhead1 = gs.vs[vhead0].next ∧ gs.vs[vhead0].next = gs.ps[vhead0].next ∧ gs.vs[vhead0].next ≠ null, pc = E16 → gs.owns(vhead) = Some(tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ gs.ps ∧ vhead ∈ gs.vs ∧ vhead ≠ null ∧ ¬ vhead ∈ gs.orl ∧ ¬ vhead ∈ gs.qrl, pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ gs.orl ∧ ¬ vhead ∈ gs.qrl ∧ vhead ≠ null ∧ vhead ∈ gs.ps ∧ vhead ∈ gs.vs ∧ gs.owns(vhead) = Some(tid) ∧ gs.vs[vhead] = mk(val, None, null) ∧ gs.ps[vhead] = gs.vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[vhead] = mk(val, None, null), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[vhead] = gs.vs[vhead], pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ gs.rvowns(gs.vretRefs(tid)) = Pending(tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ gs.vtail ∈ gs.orl + gs.qrl from vhead0, pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ gs.orl + gs.qrl from vhead2, pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ gs.vretRefs(tid) ∈ gs.vrvHp ∧ gs.vretRefs(tid) ≠ null ∧ gs.rvowns(gs.vretRefs(tid)) = Claimed(tid, gs.vs[vhead1].val) ∧ optval = Val(gs.vs[vhead1].val), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ gs.vrvHp ∧ addr ≠ null ∧ optval = Val(gs.vs[vhead1].val), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ vhead2 → nextnottid(tid, gs.vhead, gs.vs), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, gs.orl + gs.qrl, vhead1, gs.vs), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, gs.owns, gs.vs, gs.ps), pc = E10 → (obsEmpty ⊃ (gs.ps[vhead0].next ≠ gs.vs[vhead0].next ⊃ oneweakowns(tid, vhead, gs.owns, gs.vs, gs.ps);noowns(tid, gs.owns)) ;oneowns(tid, vhead, gs.owns, gs.vs, gs.ps) ), pc = E11 → (gs.ps[vhead0].next ≠ gs.vs[vhead0].next ⊃ oneweakowns(tid, vhead, gs.owns, gs.vs, gs.ps);noowns(tid, gs.owns)), pc = E4 → (obsEmpty ⊃ noowns(tid, gs.owns);oneowns(tid, vhead, gs.owns, gs.vs, gs.ps)), pc = D3 → gs.rvowns(rvref) = Pending(tid) ∧ rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null, pc = D4 → gs.vretRefs(tid) = rvref ∧ gs.rvowns(gs.vretRefs(tid)) = Pending(tid) ∧ gs.vretRefs(tid) ∈ gs.vrvHp ∧ gs.vretRefs(tid) ∈ gs.prvHp ∧ gs.vretRefs(tid) ≠ null, pc = D5 → gs.rvowns(gs.vretRefs(tid)) = Pending(tid), pc = D6 → (obsEmpty → optval = gs.vrvHp[rvref] ∧ gs.vrvHp[rvref] = gs.prvHp[rvref]) ∧ gs.rvowns(gs.vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from vhead2, pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from vhead0, pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = gs.vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next), pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from vhead0 ∧ (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ (vhead1 ≠ null → vhead1 = gs.vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next), pc = D12 → (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ (vhead1 ≠ null → vhead1 = gs.vs[vhead0].next), pc = D13 → (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ vhead1 = null, pc = D15 → (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ gs.vrvHp[rvref] = Empty ∧ gs.prvHp[rvref] = Empty, pc = D16 → (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ vhead1 = gs.vs[vhead0].next ∧ gs.vs[vhead0].next ≠ null, pc = D17 → (vhead0 ∈ gs.orl ∨ vhead0 ∈ gs.qrl) ∧ vhead1 = gs.ps[vhead0].next ∧ gs.ps[vhead0].next = gs.vs[vhead0].next ∧ gs.ps[vhead0].next ≠ null, pc = D18 → gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next, pc = D19 → gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ optval = Val(gs.vs[gs.ps[vhead2].next].val), pc = D20 → gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ optval = Val(gs.vs[gs.ps[vhead2].next].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(tid) → gs.vhead = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ gs.vs[gs.ps[vhead2].next].deqID = Some(tid) ∧ gs.rvowns(gs.vretRefs(tid)) = Claimed(tid, gs.vs[gs.ps[vhead2].next].val) ∧ (gs.ps[gs.ps[vhead2].next].deqID = None → gs.vhead = vhead2) ∧ noid(tid, gs.orl + gs.qrl, gs.ps[vhead2].next, gs.vs) ;gs.vs[gs.ps[vhead2].next].deqID ≠ None ∧ noid(tid, gs.orl + gs.qrl, vhead2, gs.vs) ∧ gs.rvowns(gs.vretRefs(tid)) = Pending(tid) ), pc = D21 → gs.ps[vhead2].next ≠ null ∧ vhead2 ∈ gs.orl ∧ vhead1 = gs.ps[vhead2].next ∧ gs.vs[gs.ps[vhead2].next].deqID = Some(tid) ∧ (gs.ps[gs.ps[vhead2].next].deqID = None → gs.vhead = vhead2) ∧ noid(tid, gs.orl + gs.qrl, gs.ps[vhead2].next, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(tid) → gs.vhead = vhead2), pc = D22 → gs.ps[gs.ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ gs.orl ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next, pc = D23 → gs.ps[gs.ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ gs.orl ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ optval = gs.vrvHp[rvref], pc = D24 → gs.ps[gs.ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ gs.orl ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ optval = gs.vrvHp[rvref] ∧ gs.vrvHp[rvref] = gs.prvHp[rvref], pc = D25 → vhead2 ∈ gs.orl ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ gs.vs[gs.ps[vhead2].next].deqID ≠ None ∧ optval = Val(gs.vs[gs.ps[vhead2].next].val) ∧ ( gs.vhead = vhead2 → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[gs.ps[gs.vhead].next].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[gs.ps[gs.vhead].next].deqID.tid, gs.vs[gs.ps[gs.vhead].next].val)), pc = D26 → vhead2 ∈ gs.orl ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ gs.vs[gs.ps[vhead2].next].deqID ≠ None ∧ gs.vs[gs.ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(gs.vs[gs.ps[vhead2].next].val) ∧ (gs.vhead = vhead2 → gs.rvowns(gs.vretRefs(tid0)) = Claimed(tid0, gs.vs[gs.ps[gs.vhead].next].val)), pc = D27 → vhead2 ∈ gs.orl ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ gs.vs[gs.ps[vhead2].next].deqID = Some(tid0) ∧ (gs.vhead = vhead2 → gs.rvowns(addr) = Claimed(tid0, optval.val)), pc = D28 → vhead2 ∈ gs.orl ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ gs.vs[gs.ps[vhead2].next].deqID = Some(tid0) ∧ gs.rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ gs.orl ∧ gs.ps[gs.ps[vhead2].next].deqID ≠ None ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ gs.rvowns(addr) = Claimed(tid0, optval.val), pc = D30 → vhead2 ∈ gs.orl ∧ gs.ps[gs.ps[vhead2].next].deqID ≠ None ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next ∧ gs.rvowns(addr) = Claimed(tid0, optval.val), pc = D31 → vhead2 ∈ gs.orl ∧ gs.ps[gs.ps[vhead2].next].deqID ≠ None ∧ gs.ps[vhead2].next ≠ null ∧ vhead1 = gs.ps[vhead2].next, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ gs.rvowns(gs.vretRefs(tid)) = Pending(tid), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ gs.orl ∧ gs.vhead ∈ gs.orl from vhead2, pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(tid) = rvref ∧ gs.pretRefs(tid) = gs.vretRefs(tid) ∧ gs.vretRefs(tid) ∈ gs.vrvHp ∧ gs.vretRefs(tid) ≠ null, pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, gs.vhead, gs.vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, gs.orl + gs.qrl, gs.vhead, gs.vs), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, gs.orl + gs.qrl, vhead2, gs.vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, gs.owns) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ obsEmpty0 → vhead4 = gs.vtail ∧ gs.ps[gs.vtail].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ vhead4 = gs.vtail ∧ gs.ps[gs.vtail].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ obsEmpty0 → gs.ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ gs.ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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, vhead7, vhead8, 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, vhead7, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs

Proof step 11 from proof fwsim-tau-othertid (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQGInv(gs), DMSQLInv(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls(gs, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), pre(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead7].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead7].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead7].next].deqID.tid, vs[ps[vhead7].next].val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ∧ gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps [gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ).ps[vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf(gs, mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 12 from proof fwsim-tau-othertid (previous step) (back to tree)

pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQGInv(mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), pc = E2 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E5 → owns(vhead) = Some(tid), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E16 → owns(vhead) = Some(tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)

Proof step 13 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 14 from proof fwsim-tau-othertid (previous step) (back to tree)

dom mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp = dom mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp), allocrv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp), listp ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), markedp (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), markedp (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), nonullRetRefs ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns), rvownerok (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns), unmarkedp (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).phead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl, ¬ dups ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ] .next ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ] .next ] .deqID ≠ None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ] .next ] .deqID .tid)) = Claimed (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ] .next ] .deqID .tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ] .next ] .val), mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl.last = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] → unmarkedp (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.tail, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs)) ∨ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl.butlast ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl.butlast.last = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).phead ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl.last ∧ unmarkedp (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ).last ∨ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.butlast ).last ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.last ] .deqID = None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ).last ] .next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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) .vhead = phead0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .phead = phead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s)

Proof step 15 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc = E2 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E5 → owns(vhead) = Some(tid), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E16 → owns(vhead) = Some(tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: pc

Additional information

Used simplifier rules: DMSQPC freely generated by D1, D2, D3, D4, D5, D6, D7, D8, D9, D10, D11, D12, D13, D14, D15, D16, D17, D18, D19, D20, D21, D22, D23, D24, D25, D26, D27, D28, D29, D30, D31, D32, D33, D34, E1, E2, E3, E4, E5, E6, E7, E8, E9, E10, E11, E12, E13, E14, E15, E16, E17, crashed, idle, ready ;; ⊦ D14 ≠ ready; (s) ⊦ D34 ≠ ready; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid); (s) ⊦ invENQ(tid, invENQvalue) ≠ τ; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ invDEQ(tid) ≠ τ; (s) ⊦ D14 ≠ idle; (s) ⊦ D34 ≠ idle; (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid); (s) ⊦ callRUN(tid) ≠ τ; (s) ⊦ D14 ≠ crashed; (s) ⊦ D34 ≠ crashed; (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s) ⊦ D14 ≠ E17; (s) ⊦ D34 ≠ E17; (s) ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s) ⊦ retENQ(tid) ≠ τ; (s) ⊦ D14 ≠ E16; (s) ⊦ D34 ≠ E16; (s) ⊦ pre(gs, ls, E16, a) ↔ a = τ; (s) ⊦ E2 ≠ E16; (s) ⊦ E3 ≠ E16; (s) ⊦ E4 ≠ E16; (s) ⊦ E5 ≠ E16; (s) ⊦ E6 ≠ E16; (s) ⊦ E7 ≠ E16; (s) ⊦ E8 ≠ E16; (s) ⊦ E9 ≠ E16; (s) ⊦ E10 ≠ E16; (s) ⊦ E11 ≠ E16; (s) ⊦ E13 ≠ E16; (s) ⊦ E14 ≠ E16; (s) ⊦ E15 ≠ E16; (s) ⊦ E16 ≠ crashed; (s) ⊦ E16 ≠ idle; (s) ⊦ E16 ≠ ready; (s) ⊦ D1 ≠ E16; (s) ⊦ D2 ≠ E16; (s) ⊦ D3 ≠ E16; (s) ⊦ D4 ≠ E16; (s) ⊦ D5 ≠ E16; (s) ⊦ D6 ≠ E16; (s) ⊦ D7 ≠ E16; (s) ⊦ D8 ≠ E16; (s) ⊦ D9 ≠ E16; (s) ⊦ D10 ≠ E16; (s) ⊦ D11 ≠ E16; (s) ⊦ D12 ≠ E16; (s) ⊦ D13 ≠ E16; (s) ⊦ D15 ≠ E16; (s) ⊦ D16 ≠ E16; (s) ⊦ D17 ≠ E16; (s) ⊦ D18 ≠ E16; (s) ⊦ D19 ≠ E16; (s) ⊦ D20 ≠ E16; (s) ⊦ D21 ≠ E16; (s) ⊦ D22 ≠ E16; (s) ⊦ D23 ≠ E16; (s) ⊦ D24 ≠ E16; (s) ⊦ D27 ≠ E16; (s) ⊦ D28 ≠ E16; (s) ⊦ D29 ≠ E16; (s) ⊦ D30 ≠ E16; (s) ⊦ D31 ≠ E16; (s) ⊦ D32 ≠ E16; (s) ⊦ D33 ≠ E16; (s) ⊦ E1 ≠ E16; (s) ⊦ E12 ≠ E16; (s) ⊦ E16 ≠ E17; (s) ⊦ D25 ≠ E16; (s) ⊦ D26 ≠ E16; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ gstepf(gs, ls, E16, τ) = gs; (s) ⊦ D14 ≠ E13; (s) ⊦ D34 ≠ E13; (s) ⊦ pre(gs, ls, E13, a) ↔ a = τ; (s) ⊦ E13 ≠ E14; (s) ⊦ E13 ≠ E15; (s) ⊦ E2 ≠ E13; (s) ⊦ E3 ≠ E13; (s) ⊦ E4 ≠ E13; (s) ⊦ E5 ≠ E13; (s) ⊦ E6 ≠ E13; (s) ⊦ E7 ≠ E13; (s) ⊦ E8 ≠ E13; (s) ⊦ E9 ≠ E13; (s) ⊦ E10 ≠ E13; (s) ⊦ E11 ≠ E13; (s) ⊦ E13 ≠ crashed; (s) ⊦ E13 ≠ idle; (s) ⊦ E13 ≠ ready; (s) ⊦ D1 ≠ E13; (s) ⊦ D2 ≠ E13; (s) ⊦ D3 ≠ E13; (s) ⊦ D4 ≠ E13; (s) ⊦ D5 ≠ E13; (s) ⊦ D6 ≠ E13; (s) ⊦ D7 ≠ E13; (s) ⊦ D8 ≠ E13; (s) ⊦ D9 ≠ E13; (s) ⊦ D10 ≠ E13; (s) ⊦ D11 ≠ E13; (s) ⊦ D12 ≠ E13; (s) ⊦ D13 ≠ E13; (s) ⊦ D15 ≠ E13; (s) ⊦ D16 ≠ E13; (s) ⊦ D17 ≠ E13; (s) ⊦ D18 ≠ E13; (s) ⊦ D19 ≠ E13; (s) ⊦ D20 ≠ E13; (s) ⊦ D21 ≠ E13; (s) ⊦ D22 ≠ E13; (s) ⊦ D23 ≠ E13; (s) ⊦ D24 ≠ E13; (s) ⊦ D27 ≠ E13; (s) ⊦ D28 ≠ E13; (s) ⊦ D29 ≠ E13; (s) ⊦ D30 ≠ E13; (s) ⊦ D31 ≠ E13; (s) ⊦ D32 ≠ E13; (s) ⊦ D33 ≠ E13; (s) ⊦ E1 ≠ E13; (s) ⊦ E12 ≠ E13; (s) ⊦ E13 ≠ E17; (s) ⊦ D25 ≠ E13; (s) ⊦ D26 ≠ E13; (s) ⊦ gstepf(gs, ls, E13, τ) = gs; (s) ⊦ D14 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ pre(gs, ls, E10, a) ↔ a = τ; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E11; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E17; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ gstepf(gs, ls, E10, τ) = gs; (s) ⊦ D14 ≠ E8; (s) ⊦ D34 ≠ E8; (s) ⊦ pre(gs, ls, E8, a) ↔ a = τ; (s) ⊦ E8 ≠ E9; (s) ⊦ E8 ≠ E14; (s) ⊦ E8 ≠ E15; (s) ⊦ E8 ≠ E11; (s) ⊦ E2 ≠ E8; (s) ⊦ E3 ≠ E8; (s) ⊦ E4 ≠ E8; (s) ⊦ E5 ≠ E8; (s) ⊦ E6 ≠ E8; (s) ⊦ E7 ≠ E8; (s) ⊦ E8 ≠ crashed; (s) ⊦ E8 ≠ idle; (s) ⊦ E8 ≠ ready; (s) ⊦ D1 ≠ E8; (s) ⊦ D2 ≠ E8; (s) ⊦ D3 ≠ E8; (s) ⊦ D4 ≠ E8; (s) ⊦ D5 ≠ E8; (s) ⊦ D6 ≠ E8; (s) ⊦ D7 ≠ E8; (s) ⊦ D8 ≠ E8; (s) ⊦ D9 ≠ E8; (s) ⊦ D10 ≠ E8; (s) ⊦ D11 ≠ E8; (s) ⊦ D12 ≠ E8; (s) ⊦ D13 ≠ E8; (s) ⊦ D15 ≠ E8; (s) ⊦ D16 ≠ E8; (s) ⊦ D17 ≠ E8; (s) ⊦ D18 ≠ E8; (s) ⊦ D19 ≠ E8; (s) ⊦ D20 ≠ E8; (s) ⊦ D21 ≠ E8; (s) ⊦ D22 ≠ E8; (s) ⊦ D23 ≠ E8; (s) ⊦ D24 ≠ E8; (s) ⊦ D27 ≠ E8; (s) ⊦ D28 ≠ E8; (s) ⊦ D29 ≠ E8; (s) ⊦ D30 ≠ E8; (s) ⊦ D31 ≠ E8; (s) ⊦ D32 ≠ E8; (s) ⊦ D33 ≠ E8; (s) ⊦ E1 ≠ E8; (s) ⊦ E8 ≠ E12; (s) ⊦ E8 ≠ E17; (s) ⊦ D25 ≠ E8; (s) ⊦ D26 ≠ E8; (s) ⊦ gstepf(gs, ls, E8, τ) = gs; (s) ⊦ D14 ≠ E7; (s) ⊦ D34 ≠ E7; (s) ⊦ pre(gs, ls, E7, a) ↔ a = τ; (s) ⊦ E7 ≠ E9; (s) ⊦ E7 ≠ E14; (s) ⊦ E7 ≠ E15; (s) ⊦ E7 ≠ E11; (s) ⊦ E2 ≠ E7; (s) ⊦ E3 ≠ E7; (s) ⊦ E4 ≠ E7; (s) ⊦ E5 ≠ E7; (s) ⊦ E6 ≠ E7; (s) ⊦ E7 ≠ crashed; (s) ⊦ E7 ≠ idle; (s) ⊦ E7 ≠ ready; (s) ⊦ D1 ≠ E7; (s) ⊦ D2 ≠ E7; (s) ⊦ D3 ≠ E7; (s) ⊦ D4 ≠ E7; (s) ⊦ D5 ≠ E7; (s) ⊦ D6 ≠ E7; (s) ⊦ D7 ≠ E7; (s) ⊦ D8 ≠ E7; (s) ⊦ D9 ≠ E7; (s) ⊦ D10 ≠ E7; (s) ⊦ D11 ≠ E7; (s) ⊦ D12 ≠ E7; (s) ⊦ D13 ≠ E7; (s) ⊦ D15 ≠ E7; (s) ⊦ D16 ≠ E7; (s) ⊦ D17 ≠ E7; (s) ⊦ D18 ≠ E7; (s) ⊦ D19 ≠ E7; (s) ⊦ D20 ≠ E7; (s) ⊦ D21 ≠ E7; (s) ⊦ D22 ≠ E7; (s) ⊦ D23 ≠ E7; (s) ⊦ D24 ≠ E7; (s) ⊦ D27 ≠ E7; (s) ⊦ D28 ≠ E7; (s) ⊦ D29 ≠ E7; (s) ⊦ D30 ≠ E7; (s) ⊦ D31 ≠ E7; (s) ⊦ D32 ≠ E7; (s) ⊦ D33 ≠ E7; (s) ⊦ E1 ≠ E7; (s) ⊦ E7 ≠ E12; (s) ⊦ E7 ≠ E17; (s) ⊦ D25 ≠ E7; (s) ⊦ D26 ≠ E7; (s) ⊦ gstepf(gs, ls, E7, τ) = gs; (s) ⊦ D14 ≠ E6; (s) ⊦ D34 ≠ E6; (s) ⊦ pre(gs, ls, E6, a) ↔ a = τ; (s) ⊦ E6 ≠ E9; (s) ⊦ E6 ≠ E14; (s) ⊦ E6 ≠ E15; (s) ⊦ E6 ≠ E11; (s) ⊦ E2 ≠ E6; (s) ⊦ E3 ≠ E6; (s) ⊦ E4 ≠ E6; (s) ⊦ E5 ≠ E6; (s) ⊦ E6 ≠ crashed; (s) ⊦ E6 ≠ idle; (s) ⊦ E6 ≠ ready; (s) ⊦ D1 ≠ E6; (s) ⊦ D2 ≠ E6; (s) ⊦ D3 ≠ E6; (s) ⊦ D4 ≠ E6; (s) ⊦ D5 ≠ E6; (s) ⊦ D6 ≠ E6; (s) ⊦ D7 ≠ E6; (s) ⊦ D8 ≠ E6; (s) ⊦ D9 ≠ E6; (s) ⊦ D10 ≠ E6; (s) ⊦ D11 ≠ E6; (s) ⊦ D12 ≠ E6; (s) ⊦ D13 ≠ E6; (s) ⊦ D15 ≠ E6; (s) ⊦ D16 ≠ E6; (s) ⊦ D17 ≠ E6; (s) ⊦ D18 ≠ E6; (s) ⊦ D19 ≠ E6; (s) ⊦ D20 ≠ E6; (s) ⊦ D21 ≠ E6; (s) ⊦ D22 ≠ E6; (s) ⊦ D23 ≠ E6; (s) ⊦ D24 ≠ E6; (s) ⊦ D27 ≠ E6; (s) ⊦ D28 ≠ E6; (s) ⊦ D29 ≠ E6; (s) ⊦ D30 ≠ E6; (s) ⊦ D31 ≠ E6; (s) ⊦ D32 ≠ E6; (s) ⊦ D33 ≠ E6; (s) ⊦ E1 ≠ E6; (s) ⊦ E6 ≠ E12; (s) ⊦ E6 ≠ E17; (s) ⊦ D25 ≠ E6; (s) ⊦ D26 ≠ E6; (s) ⊦ gstepf(gs, ls, E6, τ) = gs; (s) ⊦ D14 ≠ E5; (s) ⊦ D34 ≠ E5; (s) ⊦ pre(gs, ls, E5, a) ↔ a = τ; (s) ⊦ E5 ≠ E9; (s) ⊦ E5 ≠ E14; (s) ⊦ E5 ≠ E15; (s) ⊦ E5 ≠ E11; (s) ⊦ E2 ≠ E5; (s) ⊦ E3 ≠ E5; (s) ⊦ E4 ≠ E5; (s) ⊦ E5 ≠ crashed; (s) ⊦ E5 ≠ idle; (s) ⊦ E5 ≠ ready; (s) ⊦ D1 ≠ E5; (s) ⊦ D2 ≠ E5; (s) ⊦ D3 ≠ E5; (s) ⊦ D4 ≠ E5; (s) ⊦ D5 ≠ E5; (s) ⊦ D6 ≠ E5; (s) ⊦ D7 ≠ E5; (s) ⊦ D8 ≠ E5; (s) ⊦ D9 ≠ E5; (s) ⊦ D10 ≠ E5; (s) ⊦ D11 ≠ E5; (s) ⊦ D12 ≠ E5; (s) ⊦ D13 ≠ E5; (s) ⊦ D15 ≠ E5; (s) ⊦ D16 ≠ E5; (s) ⊦ D17 ≠ E5; (s) ⊦ D18 ≠ E5; (s) ⊦ D19 ≠ E5; (s) ⊦ D20 ≠ E5; (s) ⊦ D21 ≠ E5; (s) ⊦ D22 ≠ E5; (s) ⊦ D23 ≠ E5; (s) ⊦ D24 ≠ E5; (s) ⊦ D27 ≠ E5; (s) ⊦ D28 ≠ E5; (s) ⊦ D29 ≠ E5; (s) ⊦ D30 ≠ E5; (s) ⊦ D31 ≠ E5; (s) ⊦ D32 ≠ E5; (s) ⊦ D33 ≠ E5; (s) ⊦ E1 ≠ E5; (s) ⊦ E5 ≠ E12; (s) ⊦ E5 ≠ E17; (s) ⊦ D25 ≠ E5; (s) ⊦ D26 ≠ E5; (s) ⊦ gstepf(gs, ls, E5, τ) = gs; (s) ⊦ D14 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ pre(gs, ls, E4, a) ↔ a = τ; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E11; (s) ⊦ E2 ≠ E4; (s) ⊦ E3 ≠ E4; (s) ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ E1 ≠ E4; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E17; (s) ⊦ D25 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ gstepf(gs, ls, E4, τ) = gs; (s) ⊦ D14 ≠ E1; (s) ⊦ D34 ≠ E1; (s) ⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)); (s) ⊦ chooseE1(node, nd, success) ≠ τ; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ E1 ≠ E12; (s) ⊦ E1 ≠ E2; (s) ⊦ E1 ≠ E3; (s) ⊦ E1 ≠ E9; (s) ⊦ E1 ≠ E14; (s) ⊦ E1 ≠ E15; (s) ⊦ E1 ≠ E11; (s) ⊦ E1 ≠ crashed; (s) ⊦ E1 ≠ idle; (s) ⊦ E1 ≠ ready; (s) ⊦ D1 ≠ E1; (s) ⊦ D2 ≠ E1; (s) ⊦ D3 ≠ E1; (s) ⊦ D4 ≠ E1; (s) ⊦ D5 ≠ E1; (s) ⊦ D6 ≠ E1; (s) ⊦ D7 ≠ E1; (s) ⊦ D8 ≠ E1; (s) ⊦ D9 ≠ E1; (s) ⊦ D10 ≠ E1; (s) ⊦ D11 ≠ E1; (s) ⊦ D12 ≠ E1; (s) ⊦ D13 ≠ E1; (s) ⊦ D15 ≠ E1; (s) ⊦ D16 ≠ E1; (s) ⊦ D17 ≠ E1; (s) ⊦ D18 ≠ E1; (s) ⊦ D19 ≠ E1; (s) ⊦ D20 ≠ E1; (s) ⊦ D21 ≠ E1; (s) ⊦ D22 ≠ E1; (s) ⊦ D23 ≠ E1; (s) ⊦ D24 ≠ E1; (s) ⊦ D27 ≠ E1; (s) ⊦ D28 ≠ E1; (s) ⊦ D29 ≠ E1; (s) ⊦ D30 ≠ E1; (s) ⊦ D31 ≠ E1; (s) ⊦ D32 ≠ E1; (s) ⊦ D33 ≠ E1; (s) ⊦ D25 ≠ E1; (s) ⊦ D26 ≠ E1; (s) ⊦ gstepf(gs, ls, E1, τ) = gs; (s) ⊦ D14 ≠ D33; (s) ⊦ D33 ≠ D34; (s) ⊦ pre(gs, ls, D33, a) ↔ a = τ; (s) ⊦ D33 ≠ E2; (s) ⊦ D33 ≠ E3; (s) ⊦ D33 ≠ E9; (s) ⊦ D33 ≠ E11; (s) ⊦ D33 ≠ E12; (s) ⊦ D33 ≠ E14; (s) ⊦ D33 ≠ E15; (s) ⊦ D33 ≠ E17; (s) ⊦ D33 ≠ crashed; (s) ⊦ D33 ≠ idle; (s) ⊦ D33 ≠ ready; (s) ⊦ D1 ≠ D33; (s) ⊦ D2 ≠ D33; (s) ⊦ D3 ≠ D33; (s) ⊦ D4 ≠ D33; (s) ⊦ D5 ≠ D33; (s) ⊦ D6 ≠ D33; (s) ⊦ D7 ≠ D33; (s) ⊦ D8 ≠ D33; (s) ⊦ D9 ≠ D33; (s) ⊦ D10 ≠ D33; (s) ⊦ D11 ≠ D33; (s) ⊦ D12 ≠ D33; (s) ⊦ D13 ≠ D33; (s) ⊦ D15 ≠ D33; (s) ⊦ D16 ≠ D33; (s) ⊦ D17 ≠ D33; (s) ⊦ D18 ≠ D33; (s) ⊦ D19 ≠ D33; (s) ⊦ D20 ≠ D33; (s) ⊦ D21 ≠ D33; (s) ⊦ D22 ≠ D33; (s) ⊦ D23 ≠ D33; (s) ⊦ D24 ≠ D33; (s) ⊦ D27 ≠ D33; (s) ⊦ D28 ≠ D33; (s) ⊦ D29 ≠ D33; (s) ⊦ D30 ≠ D33; (s) ⊦ D31 ≠ D33; (s) ⊦ D32 ≠ D33; (s) ⊦ D25 ≠ D33; (s) ⊦ D26 ≠ D33; (s) ⊦ gstepf(gs, ls, D33, τ) = gs; (s) ⊦ D14 ≠ D32; (s) ⊦ D32 ≠ D34; (s) ⊦ pre(gs, ls, D32, a) ↔ a = τ; (s) ⊦ D32 ≠ E2; (s) ⊦ D32 ≠ E3; (s) ⊦ D32 ≠ E9; (s) ⊦ D32 ≠ E11; (s) ⊦ D32 ≠ E12; (s) ⊦ D32 ≠ E14; (s) ⊦ D32 ≠ E15; (s) ⊦ D32 ≠ E17; (s) ⊦ D32 ≠ crashed; (s) ⊦ D32 ≠ idle; (s) ⊦ D32 ≠ ready; (s) ⊦ D1 ≠ D32; (s) ⊦ D2 ≠ D32; (s) ⊦ D3 ≠ D32; (s) ⊦ D4 ≠ D32; (s) ⊦ D5 ≠ D32; (s) ⊦ D6 ≠ D32; (s) ⊦ D7 ≠ D32; (s) ⊦ D8 ≠ D32; (s) ⊦ D9 ≠ D32; (s) ⊦ D10 ≠ D32; (s) ⊦ D11 ≠ D32; (s) ⊦ D12 ≠ D32; (s) ⊦ D13 ≠ D32; (s) ⊦ D15 ≠ D32; (s) ⊦ D16 ≠ D32; (s) ⊦ D17 ≠ D32; (s) ⊦ D18 ≠ D32; (s) ⊦ D19 ≠ D32; (s) ⊦ D20 ≠ D32; (s) ⊦ D21 ≠ D32; (s) ⊦ D22 ≠ D32; (s) ⊦ D23 ≠ D32; (s) ⊦ D24 ≠ D32; (s) ⊦ D27 ≠ D32; (s) ⊦ D28 ≠ D32; (s) ⊦ D29 ≠ D32; (s) ⊦ D30 ≠ D32; (s) ⊦ D31 ≠ D32; (s) ⊦ D25 ≠ D32; (s) ⊦ D26 ≠ D32; (s) ⊦ gstepf(gs, ls, D32, τ) = gs; (s) ⊦ D14 ≠ D27; (s) ⊦ D27 ≠ D34; (s) ⊦ pre(gs, ls, D27, a) ↔ a = τ; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D27 ≠ D28; (s) ⊦ D27 ≠ D29; (s) ⊦ D27 ≠ D30; (s) ⊦ D27 ≠ D31; (s) ⊦ D27 ≠ E2; (s) ⊦ D27 ≠ E3; (s) ⊦ D27 ≠ E9; (s) ⊦ D27 ≠ E11; (s) ⊦ D27 ≠ E12; (s) ⊦ D27 ≠ E14; (s) ⊦ D27 ≠ E15; (s) ⊦ D27 ≠ E17; (s) ⊦ D27 ≠ crashed; (s) ⊦ D27 ≠ idle; (s) ⊦ D27 ≠ ready; (s) ⊦ D1 ≠ D27; (s) ⊦ D2 ≠ D27; (s) ⊦ D3 ≠ D27; (s) ⊦ D4 ≠ D27; (s) ⊦ D5 ≠ D27; (s) ⊦ D6 ≠ D27; (s) ⊦ D7 ≠ D27; (s) ⊦ D8 ≠ D27; (s) ⊦ D9 ≠ D27; (s) ⊦ D10 ≠ D27; (s) ⊦ D11 ≠ D27; (s) ⊦ D12 ≠ D27; (s) ⊦ D13 ≠ D27; (s) ⊦ D15 ≠ D27; (s) ⊦ D16 ≠ D27; (s) ⊦ D17 ≠ D27; (s) ⊦ D18 ≠ D27; (s) ⊦ D19 ≠ D27; (s) ⊦ D20 ≠ D27; (s) ⊦ D21 ≠ D27; (s) ⊦ D22 ≠ D27; (s) ⊦ D23 ≠ D27; (s) ⊦ D24 ≠ D27; (s) ⊦ D25 ≠ D27; (s) ⊦ D26 ≠ D27; (s) ⊦ gstepf(gs, ls, D27, τ) = gs; (s) ⊦ D14 ≠ D26; (s) ⊦ D26 ≠ D34; (s) ⊦ pre(gs, ls, D26, a) ↔ a = τ; (s) ⊦ D26 ≠ D28; (s) ⊦ D26 ≠ D29; (s) ⊦ D26 ≠ D30; (s) ⊦ D26 ≠ D31; (s) ⊦ D26 ≠ E2; (s) ⊦ D26 ≠ E3; (s) ⊦ D26 ≠ E9; (s) ⊦ D26 ≠ E11; (s) ⊦ D26 ≠ E12; (s) ⊦ D26 ≠ E14; (s) ⊦ D26 ≠ E15; (s) ⊦ D26 ≠ E17; (s) ⊦ D26 ≠ crashed; (s) ⊦ D26 ≠ idle; (s) ⊦ D26 ≠ ready; (s) ⊦ D1 ≠ D26; (s) ⊦ D2 ≠ D26; (s) ⊦ D3 ≠ D26; (s) ⊦ D4 ≠ D26; (s) ⊦ D5 ≠ D26; (s) ⊦ D6 ≠ D26; (s) ⊦ D7 ≠ D26; (s) ⊦ D8 ≠ D26; (s) ⊦ D9 ≠ D26; (s) ⊦ D10 ≠ D26; (s) ⊦ D11 ≠ D26; (s) ⊦ D12 ≠ D26; (s) ⊦ D13 ≠ D26; (s) ⊦ D15 ≠ D26; (s) ⊦ D16 ≠ D26; (s) ⊦ D17 ≠ D26; (s) ⊦ D18 ≠ D26; (s) ⊦ D19 ≠ D26; (s) ⊦ D20 ≠ D26; (s) ⊦ D21 ≠ D26; (s) ⊦ D22 ≠ D26; (s) ⊦ D23 ≠ D26; (s) ⊦ D24 ≠ D26; (s) ⊦ D25 ≠ D26; (s) ⊦ gstepf(gs, ls, D26, τ) = gs; (s) ⊦ D14 ≠ D25; (s) ⊦ D25 ≠ D34; (s) ⊦ pre(gs, ls, D25, a) ↔ a = τ; (s) ⊦ D25 ≠ D28; (s) ⊦ D25 ≠ D29; (s) ⊦ D25 ≠ D30; (s) ⊦ D25 ≠ D31; (s) ⊦ D25 ≠ E2; (s) ⊦ D25 ≠ E3; (s) ⊦ D25 ≠ E9; (s) ⊦ D25 ≠ E11; (s) ⊦ D25 ≠ E12; (s) ⊦ D25 ≠ E14; (s) ⊦ D25 ≠ E15; (s) ⊦ D25 ≠ E17; (s) ⊦ D25 ≠ crashed; (s) ⊦ D25 ≠ idle; (s) ⊦ D25 ≠ ready; (s) ⊦ D1 ≠ D25; (s) ⊦ D2 ≠ D25; (s) ⊦ D3 ≠ D25; (s) ⊦ D4 ≠ D25; (s) ⊦ D5 ≠ D25; (s) ⊦ D6 ≠ D25; (s) ⊦ D7 ≠ D25; (s) ⊦ D8 ≠ D25; (s) ⊦ D9 ≠ D25; (s) ⊦ D10 ≠ D25; (s) ⊦ D11 ≠ D25; (s) ⊦ D12 ≠ D25; (s) ⊦ D13 ≠ D25; (s) ⊦ D15 ≠ D25; (s) ⊦ D16 ≠ D25; (s) ⊦ D17 ≠ D25; (s) ⊦ D18 ≠ D25; (s) ⊦ D19 ≠ D25; (s) ⊦ D20 ≠ D25; (s) ⊦ D21 ≠ D25; (s) ⊦ D22 ≠ D25; (s) ⊦ D23 ≠ D25; (s) ⊦ D24 ≠ D25; (s) ⊦ gstepf(gs, ls, D25, τ) = gs; (s) ⊦ D14 ≠ D20; (s) ⊦ D20 ≠ D34; (s) ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ D20 ≠ D21; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E17; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ crashed; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ ready; (s) ⊦ D1 ≠ D20; (s) ⊦ D2 ≠ D20; (s) ⊦ D3 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D7 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D19 ≠ D20; (s) ⊦ gstepf(gs, ls, D20, τ) = gs; (s) ⊦ D14 ≠ D18; (s) ⊦ D18 ≠ D34; (s) ⊦ pre(gs, ls, D18, a) ↔ a = τ; (s) ⊦ D18 ≠ D19; (s) ⊦ D18 ≠ D21; (s) ⊦ D18 ≠ D22; (s) ⊦ D18 ≠ D23; (s) ⊦ D18 ≠ D24; (s) ⊦ D18 ≠ E2; (s) ⊦ D18 ≠ E3; (s) ⊦ D18 ≠ E9; (s) ⊦ D18 ≠ E11; (s) ⊦ D18 ≠ E12; (s) ⊦ D18 ≠ E14; (s) ⊦ D18 ≠ E15; (s) ⊦ D18 ≠ E17; (s) ⊦ D18 ≠ D28; (s) ⊦ D18 ≠ D29; (s) ⊦ D18 ≠ D30; (s) ⊦ D18 ≠ D31; (s) ⊦ D18 ≠ crashed; (s) ⊦ D18 ≠ idle; (s) ⊦ D18 ≠ ready; (s) ⊦ D1 ≠ D18; (s) ⊦ D2 ≠ D18; (s) ⊦ D3 ≠ D18; (s) ⊦ D4 ≠ D18; (s) ⊦ D5 ≠ D18; (s) ⊦ D6 ≠ D18; (s) ⊦ D7 ≠ D18; (s) ⊦ D8 ≠ D18; (s) ⊦ D9 ≠ D18; (s) ⊦ D10 ≠ D18; (s) ⊦ D11 ≠ D18; (s) ⊦ D12 ≠ D18; (s) ⊦ D13 ≠ D18; (s) ⊦ D15 ≠ D18; (s) ⊦ D16 ≠ D18; (s) ⊦ D17 ≠ D18; (s) ⊦ gstepf(gs, ls, D18, τ) = gs; (s) ⊦ D14 ≠ D15; (s) ⊦ D15 ≠ D34; (s) ⊦ pre(gs, ls, D15, a) ↔ a = τ; (s) ⊦ D15 ≠ D19; (s) ⊦ D15 ≠ D21; (s) ⊦ D15 ≠ D22; (s) ⊦ D15 ≠ D23; (s) ⊦ D15 ≠ D24; (s) ⊦ D15 ≠ E2; (s) ⊦ D15 ≠ E3; (s) ⊦ D15 ≠ E9; (s) ⊦ D15 ≠ E11; (s) ⊦ D15 ≠ E12; (s) ⊦ D15 ≠ E14; (s) ⊦ D15 ≠ E15; (s) ⊦ D15 ≠ E17; (s) ⊦ D15 ≠ D16; (s) ⊦ D15 ≠ D17; (s) ⊦ D15 ≠ D28; (s) ⊦ D15 ≠ D29; (s) ⊦ D15 ≠ D30; (s) ⊦ D15 ≠ D31; (s) ⊦ D15 ≠ crashed; (s) ⊦ D15 ≠ idle; (s) ⊦ D15 ≠ ready; (s) ⊦ D1 ≠ D15; (s) ⊦ D2 ≠ D15; (s) ⊦ D3 ≠ D15; (s) ⊦ D4 ≠ D15; (s) ⊦ D5 ≠ D15; (s) ⊦ D6 ≠ D15; (s) ⊦ D7 ≠ D15; (s) ⊦ D8 ≠ D15; (s) ⊦ D9 ≠ D15; (s) ⊦ D10 ≠ D15; (s) ⊦ D11 ≠ D15; (s) ⊦ D12 ≠ D15; (s) ⊦ D13 ≠ D15; (s) ⊦ gstepf(gs, ls, D15, τ) = gs; (s) ⊦ D12 ≠ D14; (s) ⊦ D12 ≠ D34; (s) ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ D12 ≠ D19; (s) ⊦ D12 ≠ D21; (s) ⊦ D12 ≠ D22; (s) ⊦ D12 ≠ D23; (s) ⊦ D12 ≠ D24; (s) ⊦ D12 ≠ D13; (s) ⊦ D12 ≠ E2; (s) ⊦ D12 ≠ E3; (s) ⊦ D12 ≠ E9; (s) ⊦ D12 ≠ E11; (s) ⊦ D12 ≠ E12; (s) ⊦ D12 ≠ E14; (s) ⊦ D12 ≠ E15; (s) ⊦ D12 ≠ E17; (s) ⊦ D12 ≠ D16; (s) ⊦ D12 ≠ D17; (s) ⊦ D12 ≠ D28; (s) ⊦ D12 ≠ D29; (s) ⊦ D12 ≠ D30; (s) ⊦ D12 ≠ D31; (s) ⊦ D12 ≠ crashed; (s) ⊦ D12 ≠ idle; (s) ⊦ D12 ≠ ready; (s) ⊦ D1 ≠ D12; (s) ⊦ D2 ≠ D12; (s) ⊦ D3 ≠ D12; (s) ⊦ D4 ≠ D12; (s) ⊦ D5 ≠ D12; (s) ⊦ D6 ≠ D12; (s) ⊦ D7 ≠ D12; (s) ⊦ D8 ≠ D12; (s) ⊦ D9 ≠ D12; (s) ⊦ D10 ≠ D12; (s) ⊦ D11 ≠ D12; (s) ⊦ gstepf(gs, ls, D12, τ) = gs; (s) ⊦ D11 ≠ D14; (s) ⊦ D11 ≠ D34; (s) ⊦ pre(gs, ls, D11, a) ↔ a = τ; (s) ⊦ D11 ≠ D19; (s) ⊦ D11 ≠ D21; (s) ⊦ D11 ≠ D22; (s) ⊦ D11 ≠ D23; (s) ⊦ D11 ≠ D24; (s) ⊦ D11 ≠ D13; (s) ⊦ D11 ≠ E2; (s) ⊦ D11 ≠ E3; (s) ⊦ D11 ≠ E9; (s) ⊦ D11 ≠ E11; (s) ⊦ D11 ≠ E12; (s) ⊦ D11 ≠ E14; (s) ⊦ D11 ≠ E15; (s) ⊦ D11 ≠ E17; (s) ⊦ D11 ≠ D16; (s) ⊦ D11 ≠ D17; (s) ⊦ D11 ≠ D28; (s) ⊦ D11 ≠ D29; (s) ⊦ D11 ≠ D30; (s) ⊦ D11 ≠ D31; (s) ⊦ D11 ≠ crashed; (s) ⊦ D11 ≠ idle; (s) ⊦ D11 ≠ ready; (s) ⊦ D1 ≠ D11; (s) ⊦ D2 ≠ D11; (s) ⊦ D3 ≠ D11; (s) ⊦ D4 ≠ D11; (s) ⊦ D5 ≠ D11; (s) ⊦ D6 ≠ D11; (s) ⊦ D7 ≠ D11; (s) ⊦ D8 ≠ D11; (s) ⊦ D9 ≠ D11; (s) ⊦ D10 ≠ D11; (s) ⊦ gstepf(gs, ls, D11, τ) = gs; (s) ⊦ D10 ≠ D14; (s) ⊦ D10 ≠ D34; (s) ⊦ pre(gs, ls, D10, a) ↔ a = τ; (s) ⊦ D10 ≠ D19; (s) ⊦ D10 ≠ D21; (s) ⊦ D10 ≠ D22; (s) ⊦ D10 ≠ D23; (s) ⊦ D10 ≠ D24; (s) ⊦ D10 ≠ D13; (s) ⊦ D10 ≠ E2; (s) ⊦ D10 ≠ E3; (s) ⊦ D10 ≠ E9; (s) ⊦ D10 ≠ E11; (s) ⊦ D10 ≠ E12; (s) ⊦ D10 ≠ E14; (s) ⊦ D10 ≠ E15; (s) ⊦ D10 ≠ E17; (s) ⊦ D10 ≠ D16; (s) ⊦ D10 ≠ D17; (s) ⊦ D10 ≠ D28; (s) ⊦ D10 ≠ D29; (s) ⊦ D10 ≠ D30; (s) ⊦ D10 ≠ D31; (s) ⊦ D10 ≠ crashed; (s) ⊦ D10 ≠ idle; (s) ⊦ D10 ≠ ready; (s) ⊦ D1 ≠ D10; (s) ⊦ D2 ≠ D10; (s) ⊦ D3 ≠ D10; (s) ⊦ D4 ≠ D10; (s) ⊦ D5 ≠ D10; (s) ⊦ D6 ≠ D10; (s) ⊦ D7 ≠ D10; (s) ⊦ D8 ≠ D10; (s) ⊦ D9 ≠ D10; (s) ⊦ gstepf(gs, ls, D10, τ) = gs; (s) ⊦ D9 ≠ D14; (s) ⊦ D9 ≠ D34; (s) ⊦ pre(gs, ls, D9, a) ↔ a = (gs.qrl = [] ⊃ checkEmp(ls.tid);τ); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ checkEmp(tid) ≠ τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D9 ≠ D19; (s) ⊦ D9 ≠ D21; (s) ⊦ D9 ≠ D22; (s) ⊦ D9 ≠ D23; (s) ⊦ D9 ≠ D24; (s) ⊦ D9 ≠ D13; (s) ⊦ D9 ≠ E2; (s) ⊦ D9 ≠ E3; (s) ⊦ D9 ≠ E9; (s) ⊦ D9 ≠ E11; (s) ⊦ D9 ≠ E12; (s) ⊦ D9 ≠ E14; (s) ⊦ D9 ≠ E15; (s) ⊦ D9 ≠ E17; (s) ⊦ D9 ≠ D16; (s) ⊦ D9 ≠ D17; (s) ⊦ D9 ≠ D28; (s) ⊦ D9 ≠ D29; (s) ⊦ D9 ≠ D30; (s) ⊦ D9 ≠ D31; (s) ⊦ D9 ≠ crashed; (s) ⊦ D9 ≠ idle; (s) ⊦ D9 ≠ ready; (s) ⊦ D1 ≠ D9; (s) ⊦ D2 ≠ D9; (s) ⊦ D3 ≠ D9; (s) ⊦ D4 ≠ D9; (s) ⊦ D5 ≠ D9; (s) ⊦ D6 ≠ D9; (s) ⊦ D7 ≠ D9; (s) ⊦ D8 ≠ D9; (s) ⊦ gstepf(gs, ls, D9, a) = gs; (s) ⊦ D8 ≠ D14; (s) ⊦ D8 ≠ D34; (s) ⊦ pre(gs, ls, D8, a) ↔ a = τ; (s) ⊦ D8 ≠ D19; (s) ⊦ D8 ≠ D21; (s) ⊦ D8 ≠ D22; (s) ⊦ D8 ≠ D23; (s) ⊦ D8 ≠ D24; (s) ⊦ D8 ≠ D13; (s) ⊦ D8 ≠ E2; (s) ⊦ D8 ≠ E3; (s) ⊦ D8 ≠ E9; (s) ⊦ D8 ≠ E11; (s) ⊦ D8 ≠ E12; (s) ⊦ D8 ≠ E14; (s) ⊦ D8 ≠ E15; (s) ⊦ D8 ≠ E17; (s) ⊦ D8 ≠ D16; (s) ⊦ D8 ≠ D17; (s) ⊦ D8 ≠ D28; (s) ⊦ D8 ≠ D29; (s) ⊦ D8 ≠ D30; (s) ⊦ D8 ≠ D31; (s) ⊦ D8 ≠ crashed; (s) ⊦ D8 ≠ idle; (s) ⊦ D8 ≠ ready; (s) ⊦ D1 ≠ D8; (s) ⊦ D2 ≠ D8; (s) ⊦ D3 ≠ D8; (s) ⊦ D4 ≠ D8; (s) ⊦ D5 ≠ D8; (s) ⊦ D6 ≠ D8; (s) ⊦ D7 ≠ D8; (s) ⊦ gstepf(gs, ls, D8, τ) = gs; (s) ⊦ D7 ≠ D14; (s) ⊦ D7 ≠ D34; (s) ⊦ pre(gs, ls, D7, a) ↔ a = τ; (s) ⊦ D7 ≠ D16; (s) ⊦ D7 ≠ D17; (s) ⊦ D7 ≠ D21; (s) ⊦ D7 ≠ D22; (s) ⊦ D7 ≠ D23; (s) ⊦ D7 ≠ D24; (s) ⊦ D7 ≠ D28; (s) ⊦ D7 ≠ D29; (s) ⊦ D7 ≠ D30; (s) ⊦ D7 ≠ D31; (s) ⊦ D7 ≠ E2; (s) ⊦ D7 ≠ E3; (s) ⊦ D7 ≠ E9; (s) ⊦ D7 ≠ E11; (s) ⊦ D7 ≠ E12; (s) ⊦ D7 ≠ E14; (s) ⊦ D7 ≠ E15; (s) ⊦ D7 ≠ E17; (s) ⊦ D7 ≠ D13; (s) ⊦ D7 ≠ D19; (s) ⊦ D7 ≠ crashed; (s) ⊦ D7 ≠ idle; (s) ⊦ D7 ≠ ready; (s) ⊦ D1 ≠ D7; (s) ⊦ D2 ≠ D7; (s) ⊦ D3 ≠ D7; (s) ⊦ D4 ≠ D7; (s) ⊦ D5 ≠ D7; (s) ⊦ D6 ≠ D7; (s) ⊦ gstepf(gs, ls, D7, τ) = gs; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D34; (s) ⊦ pre(gs, ls, D6, a) ↔ a = τ; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ gstepf(gs, ls, D6, τ) = gs; (s) ⊦ D5 ≠ D14; (s) ⊦ D5 ≠ D34; (s) ⊦ pre(gs, ls, D5, a) ↔ a = τ; (s) ⊦ D5 ≠ D16; (s) ⊦ D5 ≠ D17; (s) ⊦ D5 ≠ D21; (s) ⊦ D5 ≠ D22; (s) ⊦ D5 ≠ D23; (s) ⊦ D5 ≠ D24; (s) ⊦ D5 ≠ D28; (s) ⊦ D5 ≠ D29; (s) ⊦ D5 ≠ D30; (s) ⊦ D5 ≠ D31; (s) ⊦ D5 ≠ E2; (s) ⊦ D5 ≠ E3; (s) ⊦ D5 ≠ E9; (s) ⊦ D5 ≠ E11; (s) ⊦ D5 ≠ E12; (s) ⊦ D5 ≠ E14; (s) ⊦ D5 ≠ E15; (s) ⊦ D5 ≠ E17; (s) ⊦ D5 ≠ D13; (s) ⊦ D5 ≠ D19; (s) ⊦ D5 ≠ crashed; (s) ⊦ D5 ≠ idle; (s) ⊦ D5 ≠ ready; (s) ⊦ D1 ≠ D5; (s) ⊦ D2 ≠ D5; (s) ⊦ D3 ≠ D5; (s) ⊦ D4 ≠ D5; (s) ⊦ gstepf(gs, ls, D5, τ) = gs; (s) ⊦ D2 ≠ D14; (s) ⊦ D2 ≠ D34; (s) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ chooseD2(rvref, optval) ≠ τ; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ D2 ≠ D3; (s) ⊦ D2 ≠ D4; (s) ⊦ D2 ≠ D16; (s) ⊦ D2 ≠ D17; (s) ⊦ D2 ≠ D21; (s) ⊦ D2 ≠ D22; (s) ⊦ D2 ≠ D23; (s) ⊦ D2 ≠ D24; (s) ⊦ D2 ≠ D28; (s) ⊦ D2 ≠ D29; (s) ⊦ D2 ≠ D30; (s) ⊦ D2 ≠ D31; (s) ⊦ D2 ≠ E2; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E11; (s) ⊦ D2 ≠ E12; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E17; (s) ⊦ D2 ≠ D13; (s) ⊦ D2 ≠ D19; (s) ⊦ D2 ≠ crashed; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ ready; (s) ⊦ D1 ≠ D2; (s) ⊦ gstepf(gs, ls, D2, τ) = gs; (s) ⊦ D1 ≠ D14; (s) ⊦ D1 ≠ D34; (s) ⊦ pre(gs, ls, D1, a) ↔ a = τ; (s) ⊦ D1 ≠ D3; (s) ⊦ D1 ≠ D4; (s) ⊦ D1 ≠ D16; (s) ⊦ D1 ≠ D17; (s) ⊦ D1 ≠ D21; (s) ⊦ D1 ≠ D22; (s) ⊦ D1 ≠ D23; (s) ⊦ D1 ≠ D24; (s) ⊦ D1 ≠ D28; (s) ⊦ D1 ≠ D29; (s) ⊦ D1 ≠ D30; (s) ⊦ D1 ≠ D31; (s) ⊦ D1 ≠ E2; (s) ⊦ D1 ≠ E3; (s) ⊦ D1 ≠ E9; (s) ⊦ D1 ≠ E11; (s) ⊦ D1 ≠ E12; (s) ⊦ D1 ≠ E14; (s) ⊦ D1 ≠ E15; (s) ⊦ D1 ≠ E17; (s) ⊦ D1 ≠ D13; (s) ⊦ D1 ≠ D19; (s) ⊦ D1 ≠ crashed; (s) ⊦ D1 ≠ idle; (s) ⊦ D1 ≠ ready; (s) ⊦ gstepf(gs, ls, D1, τ) = gs; (s)

Proof step 16 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D3, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs:= vretRefs1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs1, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ gstepf(gs, ls, D3, τ) = gs.vretRefs:= gs.vretRefs(ls.tid; ls.rvref); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D3 ≠ D26; (s) ⊦ D3 ≠ D25; (s) ⊦ D2 ≠ D3; (s) ⊦ D1 ≠ D3; (s) ⊦ D3 ≠ ready; (s) ⊦ D3 ≠ idle; (s) ⊦ D3 ≠ crashed; (s) ⊦ D3 ≠ D19; (s) ⊦ D3 ≠ D18; (s) ⊦ D3 ≠ D15; (s) ⊦ D3 ≠ D13; (s) ⊦ D3 ≠ D12; (s) ⊦ D3 ≠ D11; (s) ⊦ D3 ≠ D10; (s) ⊦ D3 ≠ D9; (s) ⊦ D3 ≠ D8; (s) ⊦ D3 ≠ E17; (s) ⊦ D3 ≠ E16; (s) ⊦ D3 ≠ E15; (s) ⊦ D3 ≠ E14; (s) ⊦ D3 ≠ E13; (s) ⊦ D3 ≠ E12; (s) ⊦ D3 ≠ E11; (s) ⊦ D3 ≠ E10; (s) ⊦ D3 ≠ E9; (s) ⊦ D3 ≠ E8; (s) ⊦ D3 ≠ E7; (s) ⊦ D3 ≠ E6; (s) ⊦ D3 ≠ E5; (s) ⊦ D3 ≠ E4; (s) ⊦ D3 ≠ E3; (s) ⊦ D3 ≠ E2; (s) ⊦ D3 ≠ E1; (s) ⊦ D3 ≠ D33; (s) ⊦ D3 ≠ D32; (s) ⊦ D3 ≠ D31; (s) ⊦ D3 ≠ D30; (s) ⊦ D3 ≠ D29; (s) ⊦ D3 ≠ D28; (s) ⊦ D3 ≠ D27; (s) ⊦ D3 ≠ D24; (s) ⊦ D3 ≠ D23; (s) ⊦ D3 ≠ D22; (s) ⊦ D3 ≠ D21; (s) ⊦ D3 ≠ D20; (s) ⊦ D3 ≠ D17; (s) ⊦ D3 ≠ D16; (s) ⊦ D3 ≠ D7; (s) ⊦ D3 ≠ D6; (s) ⊦ D3 ≠ D5; (s) ⊦ D3 ≠ D4; (s) ⊦ pre(gs, ls, D3, a) ↔ a = τ; (s) ⊦ D3 ≠ D34; (s) ⊦ D3 ≠ D14; (s)

Proof step 17 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ null, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs(tid; rvref), pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 18 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 19 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ null, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs(tid; rvref), pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 20 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ null, tid ≠ als.tid, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs(tid; rvref), pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs(tid; rvref), pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs(tid; rvref), pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 21 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 22 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D4, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs:= vretRefs2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs2, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ gstepf(gs, ls, D4, τ) = gs.pretRefs:= gs.pretRefs(ls.tid; gs.vretRefs(ls.tid)); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D4 ≠ D26; (s) ⊦ D4 ≠ D25; (s) ⊦ D3 ≠ D4; (s) ⊦ D2 ≠ D4; (s) ⊦ D1 ≠ D4; (s) ⊦ D4 ≠ ready; (s) ⊦ D4 ≠ idle; (s) ⊦ D4 ≠ crashed; (s) ⊦ D4 ≠ D19; (s) ⊦ D4 ≠ D18; (s) ⊦ D4 ≠ D15; (s) ⊦ D4 ≠ D13; (s) ⊦ D4 ≠ D12; (s) ⊦ D4 ≠ D11; (s) ⊦ D4 ≠ D10; (s) ⊦ D4 ≠ D9; (s) ⊦ D4 ≠ D8; (s) ⊦ D4 ≠ E17; (s) ⊦ D4 ≠ E16; (s) ⊦ D4 ≠ E15; (s) ⊦ D4 ≠ E14; (s) ⊦ D4 ≠ E13; (s) ⊦ D4 ≠ E12; (s) ⊦ D4 ≠ E11; (s) ⊦ D4 ≠ E10; (s) ⊦ D4 ≠ E9; (s) ⊦ D4 ≠ E8; (s) ⊦ D4 ≠ E7; (s) ⊦ D4 ≠ E6; (s) ⊦ D4 ≠ E5; (s) ⊦ D4 ≠ E4; (s) ⊦ D4 ≠ E3; (s) ⊦ D4 ≠ E2; (s) ⊦ D4 ≠ E1; (s) ⊦ D4 ≠ D33; (s) ⊦ D4 ≠ D32; (s) ⊦ D4 ≠ D31; (s) ⊦ D4 ≠ D30; (s) ⊦ D4 ≠ D29; (s) ⊦ D4 ≠ D28; (s) ⊦ D4 ≠ D27; (s) ⊦ D4 ≠ D24; (s) ⊦ D4 ≠ D23; (s) ⊦ D4 ≠ D22; (s) ⊦ D4 ≠ D21; (s) ⊦ D4 ≠ D20; (s) ⊦ D4 ≠ D17; (s) ⊦ D4 ≠ D16; (s) ⊦ D4 ≠ D7; (s) ⊦ D4 ≠ D6; (s) ⊦ D4 ≠ D5; (s) ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ D4 ≠ D34; (s) ⊦ D4 ≠ D14; (s)

Proof step 23 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ prvHp, vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs(tid; vretRefs(tid)), vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 24 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 25 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs(tid; vretRefs(tid)), vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 26 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, vretRefs(tid) ∈ prvHp, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs(tid; vretRefs(tid)), vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs(tid; vretRefs(tid)), vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs(tid; vretRefs(tid)), vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 27 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 28 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D13, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp:= vrvHp1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp1, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ gstepf(gs, ls, D13, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, Empty]; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D13 ≠ D26; (s) ⊦ D13 ≠ D25; (s) ⊦ D12 ≠ D13; (s) ⊦ D11 ≠ D13; (s) ⊦ D10 ≠ D13; (s) ⊦ D9 ≠ D13; (s) ⊦ D8 ≠ D13; (s) ⊦ D7 ≠ D13; (s) ⊦ D6 ≠ D13; (s) ⊦ D5 ≠ D13; (s) ⊦ D4 ≠ D13; (s) ⊦ D3 ≠ D13; (s) ⊦ D2 ≠ D13; (s) ⊦ D1 ≠ D13; (s) ⊦ D13 ≠ ready; (s) ⊦ D13 ≠ idle; (s) ⊦ D13 ≠ crashed; (s) ⊦ D13 ≠ D33; (s) ⊦ D13 ≠ D32; (s) ⊦ D13 ≠ D31; (s) ⊦ D13 ≠ D30; (s) ⊦ D13 ≠ D29; (s) ⊦ D13 ≠ D28; (s) ⊦ D13 ≠ D27; (s) ⊦ D13 ≠ D17; (s) ⊦ D13 ≠ D16; (s) ⊦ D13 ≠ E17; (s) ⊦ D13 ≠ E16; (s) ⊦ D13 ≠ E15; (s) ⊦ D13 ≠ E14; (s) ⊦ D13 ≠ E13; (s) ⊦ D13 ≠ E12; (s) ⊦ D13 ≠ E11; (s) ⊦ D13 ≠ E10; (s) ⊦ D13 ≠ E9; (s) ⊦ D13 ≠ E8; (s) ⊦ D13 ≠ E7; (s) ⊦ D13 ≠ E6; (s) ⊦ D13 ≠ E5; (s) ⊦ D13 ≠ E4; (s) ⊦ D13 ≠ E3; (s) ⊦ D13 ≠ E2; (s) ⊦ D13 ≠ E1; (s) ⊦ D13 ≠ D24; (s) ⊦ D13 ≠ D23; (s) ⊦ D13 ≠ D22; (s) ⊦ D13 ≠ D21; (s) ⊦ D13 ≠ D20; (s) ⊦ D13 ≠ D19; (s) ⊦ D13 ≠ D18; (s) ⊦ D13 ≠ D15; (s) ⊦ pre(gs, ls, D13, a) ↔ a = τ; (s) ⊦ D13 ≠ D34; (s) ⊦ D13 ≠ D14; (s)

Proof step 29 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 30 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 31 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 32 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 33 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 34 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Empty], prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 35 from proof fwsim-tau-othertid (previous step) (back to tree)

als.oval = vrvHp[vretRefs(als.tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), als.oval ≠ vrvHp[vretRefs(tid), Empty][vretRefs(als.tid)], orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 36 from proof fwsim-tau-othertid (previous step) (back to tree)

als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, optval = vrvHp[vretRefs(tid0)], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), optval ≠ vrvHp[vretRefs(tid), Empty][vretRefs(tid0)], orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 37 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vrvHp[vretRefs(tid0)] ≠ vrvHp[vretRefs(tid), Empty][vretRefs(tid0)], orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid0)] = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0

Proof step 38 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 39 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vrvHp[vretRefs(tid0)] ≠ vrvHp[vretRefs(tid), Empty][vretRefs(tid0)], orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid0)] = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, pc0 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, pc0 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), pc0 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, pc0 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, pc0 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), pc0 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), pc0 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), pc0 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, pc0 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, pc0 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, pc0 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, pc0 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), pc0 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), pc0 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), pc0 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, pc0 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], pc0 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], pc0 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), pc0 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), pc0 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), pc0 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), pc0 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), pc0 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), pc0 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, pc0 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), pc0 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), pc0 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), pc0 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), pc0 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), pc0 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), pc0 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), pc0 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, pc0 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, pc0 = E4 ∨ pc0 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D18 ∨ pc0 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 ∨ pc0 = E1 ∨ pc0 = E12 ∨ pc0 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), pc0 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), pc0 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), pc0 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 ⊦

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) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .othertid = tid0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .addr = rvref0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s)

Proof step 40 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vrvHp[vretRefs(tid0)] ≠ vrvHp[vretRefs(tid), Empty][vretRefs(tid0)], orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid0)] = optval1, pc0 = E4 → (obsEmpty0 ⊃ noowns(tid0, owns);oneowns(tid0, vhead3, owns, vs, ps)), pc0 = E11 → (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid0, vhead3, owns, vs, ps);noowns(tid0, owns)), pc0 = E10 → (obsEmpty0 ⊃ (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid0, vhead3, owns, vs, ps);noowns(tid0, owns));oneowns(tid0, vhead3, owns, vs, ps)), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → oneowns(tid0, vhead3, owns, vs, ps), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 ∨ pc0 = E1 ∨ pc0 = E12 ∨ pc0 = E17 → noowns(tid0, owns), pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → noid(tid0, orl + qrl, vhead5, vs), pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D18 ∨ pc0 = D19 → noid(tid0, orl + qrl, vhead6, vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 → noid(tid0, orl + qrl, vhead7, vs), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead7 ≠ vhead6 → nextnottid(tid0, vhead7, vs), pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 → nextnottid(tid0, vhead7, vs), pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 → addr0 ∈ vrvHp ∧ addr0 ≠ null ∧ optval1 = Val(vs[vhead5].val), pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → obsEmpty0 ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vhead5].val) ∧ optval1 = Val(vs[vhead5].val), pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 → vretRefs(tid0) = rvref0 ∧ pretRefs(tid0) = vretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null, pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 → vhead4 ∈ orl + qrl from vhead6, pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 → vhead6 ≠ vhead4 ∧ vhead8 ∈ orl + qrl from vhead4, pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 → vhead6 ∈ orl ∧ vhead7 ∈ orl from vhead6, pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ¬ obsEmpty0, pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 → ¬ obsEmpty0 ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 → ¬ obsEmpty0 ∧ rvowns(vretRefs(tid0)) = Pending(tid0), pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ps[vhead3] = vs[vhead3], pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vs[vhead3] = mk(val0, None, null), pc0 = E4 ∨ pc0 = E10 → ¬ obsEmpty0 → ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl ∧ vhead3 ≠ null ∧ vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ owns(vhead3) = Some(tid0) ∧ vs[vhead3] = mk(val0, None, null) ∧ ps[vhead3] = vs[vhead3], pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ vhead3 ≠ null ∧ ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl, pc0 = E16 → owns(vhead3) = Some(tid0), pc0 = E15 → owns(vhead3) = Some(tid0) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next = ps[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E14 → owns(vhead3) = Some(tid0) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E13 → owns(vhead3) = Some(tid0), pc0 = E12 → obsEmpty0 ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next ∈ orl ∨ vs[vhead4].next ∈ qrl) ∧ vs[vhead4].next = vhead3 ∧ ps[vhead4].next = vs[vhead4].next ∧ vs[vhead4].next ∈ ps ∧ vs[vhead4].next ∈ vs ∧ vs[vhead4].next ≠ null, pc0 = E11 → obsEmpty0 ∧ vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid0) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E10 → obsEmpty0 → vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid0) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E9 → owns(vhead3) = Some(tid0) ∧ vhead5 = null ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E8 → owns(vhead3) = Some(tid0) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E7 → owns(vhead3) = Some(tid0) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E6 → owns(vhead3) = Some(tid0) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (ps[vhead4].next = null → vhead4 = vhead8), pc0 = E5 → owns(vhead3) = Some(tid0), pc0 = E3 → owns(vhead3) = Some(tid0), pc0 = E2 → owns(vhead3) = Some(tid0), pc0 = D34 → optval1 = vrvHp[vretRefs(tid0)] ∧ vrvHp[vretRefs(tid0)] = prvHp[pretRefs(tid0)] ∧ vretRefs(tid0) = pretRefs(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null ∧ rvowns(vretRefs(tid0)) = (vrvHp[vretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, vrvHp[vretRefs(tid0)].val)), pc0 = D31 → vhead6 ∈ orl ∧ ps[ps[vhead6].next].deqID ≠ None ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next, pc0 = D30 → vhead6 ∈ orl ∧ ps[ps[vhead6].next].deqID ≠ None ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ rvowns(addr0) = Claimed(tid2, optval1.val), pc0 = D29 → vhead6 ∈ orl ∧ ps[ps[vhead6].next].deqID ≠ None ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ rvowns(addr0) = Claimed(tid2, optval1.val), pc0 = D28 → vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID = Some(tid2) ∧ rvowns(addr0) = Claimed(tid2, optval1.val), pc0 = D27 → vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID = Some(tid2) ∧ (vhead7 = vhead6 → rvowns(addr0) = Claimed(tid2, optval1.val)), pc0 = D26 → vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID ≠ None ∧ vs[ps[vhead6].next].deqID = Some(tid2) ∧ optval1 = Val(vs[ps[vhead6].next].val) ∧ (vhead7 = vhead6 → rvowns(vretRefs(tid2)) = Claimed(tid2, vs[ps[vhead6].next].val)), pc0 = D25 → vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID ≠ None ∧ optval1 = Val(vs[ps[vhead6].next].val) ∧ (vhead7 = vhead6 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead6].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead6].next].deqID.tid, vs[ps[vhead6].next].val)), pc0 = D24 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0], pc0 = D23 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0], pc0 = D22 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next, pc0 = D21 → ps[vhead6].next ≠ null ∧ vhead6 ∈ orl ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID = Some(tid0) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid0, orl + qrl, ps[vhead6].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid0) → vhead7 = vhead6), pc0 = D20 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = Val(vs[ps[vhead6].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid0) → vhead7 = vhead6 ∧ obsEmpty0) ∧ (obsEmpty0 ⊃ vs[ps[vhead6].next].deqID = Some(tid0) ∧ rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead6].next].val) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid0, orl + qrl, ps[vhead6].next, vs) ;vs[ps[vhead6].next].deqID ≠ None ∧ noid(tid0, orl + qrl, vhead6, vs) ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ), pc0 = D19 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = Val(vs[ps[vhead6].next].val), pc0 = D18 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next, pc0 = D17 → (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = ps[vhead4].next ∧ ps[vhead4].next = vs[vhead4].next ∧ ps[vhead4].next ≠ null, pc0 = D16 → (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = D15 → (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vrvHp[rvref0] = Empty ∧ prvHp[rvref0] = Empty, pc0 = D14 → (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vrvHp[rvref0] = Empty ∧ vhead5 = null, pc0 = D13 → (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = null, pc0 = D12 → (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next), pc0 = D11 → vhead8 ∈ orl + qrl from vhead4 ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead6].next) ∧ (vhead6 ≠ vhead4 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next), pc0 = D10 → vhead8 ∈ orl + qrl from vhead4 ∧ (vhead5 ≠ null → vhead5 = vs[vhead6].next) ∧ (vhead6 ≠ vhead4 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next), pc0 = D9 → vhead8 ∈ orl + qrl from vhead4, pc0 = D8 → vhead8 ∈ orl + qrl from vhead6, pc0 = D6 → (obsEmpty0 → optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0]) ∧ rvowns(vretRefs(tid0)) = (optval1 = Empty ∨ ¬ obsEmpty0 ⊃ Pending(tid0);Claimed(tid0, optval1.val)), pc0 = D5 → rvowns(vretRefs(tid0)) = Pending(tid0), pc0 = D4 → vretRefs(tid0) = rvref0 ∧ rvowns(vretRefs(tid0)) = Pending(tid0) ∧ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ∈ prvHp ∧ vretRefs(tid0) ≠ null, pc0 = D3 → rvowns(rvref0) = Pending(tid0) ∧ rvref0 ∈ vrvHp ∧ rvref0 ∈ prvHp ∧ rvref0 ≠ null, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[retval-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vrvHp, vretRefs(tid), Empty, vretRefs(tid0)], <all paths>

Additional information

Used simplifier rules: ⊦ rvownerok(vretRefs, vrvHp, rvowns) ∧ tid ≠ tid0 → ( vretRefs(tid) = vretRefs(tid0) ↔ vretRefs(tid) = null ∧ vretRefs(tid0) = null); (as) Used terms: vrvHp, vretRefs(tid), Empty, vretRefs(tid0)

Proof step 41 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 42 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D16, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 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) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl:= qrl1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl1, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps:= ps1 = mkgs (ps1, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ gstepf(gs, ls, D16, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt;gs.qrl)) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D16 ≠ D26; (s) ⊦ D16 ≠ D25; (s) ⊦ D15 ≠ D16; (s) ⊦ D13 ≠ D16; (s) ⊦ D12 ≠ D16; (s) ⊦ D11 ≠ D16; (s) ⊦ D10 ≠ D16; (s) ⊦ D9 ≠ D16; (s) ⊦ D8 ≠ D16; (s) ⊦ D7 ≠ D16; (s) ⊦ D6 ≠ D16; (s) ⊦ D5 ≠ D16; (s) ⊦ D4 ≠ D16; (s) ⊦ D3 ≠ D16; (s) ⊦ D2 ≠ D16; (s) ⊦ D1 ≠ D16; (s) ⊦ D16 ≠ ready; (s) ⊦ D16 ≠ idle; (s) ⊦ D16 ≠ crashed; (s) ⊦ D16 ≠ D19; (s) ⊦ D16 ≠ D18; (s) ⊦ D16 ≠ E17; (s) ⊦ D16 ≠ E16; (s) ⊦ D16 ≠ E15; (s) ⊦ D16 ≠ E14; (s) ⊦ D16 ≠ E13; (s) ⊦ D16 ≠ E12; (s) ⊦ D16 ≠ E11; (s) ⊦ D16 ≠ E10; (s) ⊦ D16 ≠ E9; (s) ⊦ D16 ≠ E8; (s) ⊦ D16 ≠ E7; (s) ⊦ D16 ≠ E6; (s) ⊦ D16 ≠ E5; (s) ⊦ D16 ≠ E4; (s) ⊦ D16 ≠ E3; (s) ⊦ D16 ≠ E2; (s) ⊦ D16 ≠ E1; (s) ⊦ D16 ≠ D20; (s) ⊦ D16 ≠ D31; (s) ⊦ D16 ≠ D30; (s) ⊦ D16 ≠ D29; (s) ⊦ D16 ≠ D28; (s) ⊦ D16 ≠ D27; (s) ⊦ D16 ≠ D24; (s) ⊦ D16 ≠ D23; (s) ⊦ D16 ≠ D22; (s) ⊦ D16 ≠ D21; (s) ⊦ D16 ≠ D17; (s) ⊦ doEnq(tid) ≠ τ; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ D16 ≠ D34; (s) ⊦ D14 ≠ D16; (s)

Proof step 43 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 44 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 45 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = 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] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ E4 ≠ E10; (s)

Proof step 46 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead0 ≠ qrl.last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 47 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead0 ≠ qrl.last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 48 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead0 ≠ (phead0 ' + orl0).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 49 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 50 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead0 ≠ (phead0 ' + orl0).last, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E10 = D3 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D4 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D5 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D6 → ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = D8 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D9 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D10 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D11 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E10 = D13 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D14 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D15 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E10 = D16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D17 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D18 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D19 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl .head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E10 = D21 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl .head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E10 = D22 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D23 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D24 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D25 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (( mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps ⊕ mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps ⊕ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D26 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D27 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D29 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D31 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D34 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = E2 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E3 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E5 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E6 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail), E10 = E7 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E8 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E9 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E10 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E11 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E10 = E13 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E14 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E15 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, E10 = E4 ∨ E10 = E10 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D13 ∨ E10 = D14 ∨ E10 = D15 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 ∨ E10 = E1 ∨ E10 = E12 ∨ E10 = E17 → noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps), E10 = E10 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ), E10 = E11 → ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ), E10 = E4 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) 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) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E10 ≠ E11; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ ready; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ E17; (s) ⊦ D2 ≠ E10; (s) ⊦ D1 ≠ E10; (s)

Proof step 51 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, ¬ ( ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead0 ≠ (phead0 ' + orl0).last, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (ps[(orl + (phead0 ' + orl0).butlast).last].next ≠ vs[(orl + (phead0 ' + orl0).butlast).last].next ⊃ oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps) ;noowns(tid1, owns) ), ps[(orl + (phead0 ' + orl0).butlast).last].next = null ∧ owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1) ∨ ((orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0) ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = vs[(orl + (phead0 ' + orl0).butlast).last].next, vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last], <all paths>

Additional information

Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last

Proof step 52 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 53 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, (orl + (phead0 ' + orl0).butlast).last = vhead0, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, ¬ ( ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead0 ≠ (phead0 ' + orl0).last, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (ps[(orl + (phead0 ' + orl0).butlast).last].next ≠ vs[(orl + (phead0 ' + orl0).butlast).last].next ⊃ oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps) ;noowns(tid1, owns) ), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, ps[(orl + (phead0 ' + orl0).butlast).last].next = null ∧ owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1) ∨ ((orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0) ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = vs[(orl + (phead0 ' + orl0).butlast).last].next ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 54 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps, orl + phead0 ' + orl0, owns, (orl + (phead0 ' + orl0).butlast).last, vs

Proof step 55 from proof fwsim-tau-othertid (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 56 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), listp(orl + phead0 ' + orl0, vs, ps, owns) ∧ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 → (∃ rl1, rl2. orl + phead0 ' + orl0 = rl1 + (orl + (phead0 ' + orl0).butlast).last ' + rl2 ∧ listp((orl + (phead0 ' + orl0).butlast).last ' + rl2, vs, ps, owns)), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 57 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: orl2

Additional information

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

Proof step 58 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, orl2 = [], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 59 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ', vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].next = null, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].val = vs[(orl + (phead0 ' + orl0).butlast).last].val, ps[vs[(orl + (phead0 ' + orl0).butlast).last].next] = vs[vs[(orl + (phead0 ' + orl0).butlast).last].next], dom vrvHp = dom prvHp, owns((orl + (phead0 ' + orl0).butlast).last) = None, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ null, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps, vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs, (orl + (phead0 ' + orl0).butlast).last ∈ ps, (orl + (phead0 ' + orl0).butlast).last ∈ vs, vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ weak?(vs[(orl + (phead0 ' + orl0).butlast).last].deqID), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(orl + (phead0 ' + orl0).butlast).last].deqID = vs[(orl + (phead0 ' + orl0).butlast).last].deqID ∨ ps[(orl + (phead0 ' + orl0).butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 60 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 61 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + phead0 ' + orl0.butlast).last ', vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].deqID = None, ps[(orl + phead0 ' + orl0.butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].next = null, ps[(orl + phead0 ' + orl0.butlast).last].val = vs[(orl + phead0 ' + orl0.butlast).last].val, ps[vs[(orl + phead0 ' + orl0.butlast).last].next] = vs[vs[(orl + phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + phead0 ' + orl0.butlast).last].next) = Weak(tid1), owns((orl + phead0 ' + orl0.butlast).last) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + phead0 ' + orl0.butlast).last ≠ null, (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].val, optval1, vs[(orl + phead0 ' + orl0.butlast).last].next, nd0, true, (orl + phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), oneweakowns(tid1, vs[(orl + phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, (orl + phead0 ' + orl0.butlast).last ∈ vs, (orl + phead0 ' + orl0.butlast).last ∈ ps, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ vs, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ weak?(vs[(orl + phead0 ' + orl0.butlast).last].deqID), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + phead0 ' + orl0.butlast).last ∈ orl ∨ (orl + phead0 ' + orl0.butlast).last = phead0 ∨ (orl + phead0 ' + orl0.butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), ps[(orl + phead0 ' + orl0.butlast).last].deqID = vs[(orl + phead0 ' + orl0.butlast).last].deqID ∨ ps[(orl + phead0 ' + orl0.butlast).last].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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 62 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (phead0 ' + orl0.butlast).last ', vs[orl0.last].deqID = None, ps[phead0].deqID = None, vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None, ps[(phead0 ' + orl0.butlast).last].next = null, vs[orl0.last].next = null, vs[vs[(phead0 ' + orl0.butlast).last].next].next = null, ps[(phead0 ' + orl0.butlast).last].val = vs[(phead0 ' + orl0.butlast).last].val, ps[vs[(phead0 ' + orl0.butlast).last].next] = vs[vs[(phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid1), owns((phead0 ' + orl0.butlast).last) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl0.butlast).last ≠ orl0.last, (phead0 ' + orl0.butlast).last ≠ null, vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, (phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(phead0 ' + orl0.butlast).last].next].val, optval1, vs[(phead0 ' + orl0.butlast).last].next, nd0, true, (phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), oneweakowns(tid1, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, vs[(phead0 ' + orl0.butlast).last].next ∈ vs, vs[(phead0 ' + orl0.butlast).last].next ∈ ps, (phead0 ' + orl0.butlast).last ∈ orl0, (phead0 ' + orl0.butlast).last ∈ vs, (phead0 ' + orl0.butlast).last ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[(phead0 ' + orl0.butlast).last].deqID), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(phead0 ' + orl0.butlast).last].deqID = vs[(phead0 ' + orl0.butlast).last].deqID ∨ ps[(phead0 ' + orl0.butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 63 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 64 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead4 = vhead8, vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 65 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead0 ≠ qrl.last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 66 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + orl0, rvowns(vretRefs(tid)) = Pending(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead0 ≠ qrl.last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 67 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead0 ≠ (phead0 ' + orl0).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0 ⊦

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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last], <all paths>

Additional information

Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last

Proof step 68 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 69 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, (orl + (phead0 ' + orl0).butlast).last = vhead0, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead0 ≠ (phead0 ' + orl0).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 70 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps, orl + phead0 ' + orl0, owns, (orl + (phead0 ' + orl0).butlast).last, vs

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

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), listp(orl + phead0 ' + orl0, vs, ps, owns) ∧ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 → (∃ rl1, rl2. orl + phead0 ' + orl0 = rl1 + (orl + (phead0 ' + orl0).butlast).last ' + rl2 ∧ listp((orl + (phead0 ' + orl0).butlast).last ' + rl2, vs, ps, owns)), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 73 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: orl2

Additional information

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

Proof step 74 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl2 = [], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ 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 75 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ', vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].val = vs[(orl + (phead0 ' + orl0).butlast).last].val, ps[vs[(orl + (phead0 ' + orl0).butlast).last].next] = vs[vs[(orl + (phead0 ' + orl0).butlast).last].next], dom vrvHp = dom prvHp, owns((orl + (phead0 ' + orl0).butlast).last) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + (phead0 ' + orl0).butlast).last ≠ null, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(orl + (phead0 ' + orl0).butlast).last].next)), vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps, vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs, (orl + (phead0 ' + orl0).butlast).last ∈ ps, (orl + (phead0 ' + orl0).butlast).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ weak?(vs[(orl + (phead0 ' + orl0).butlast).last].deqID), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(orl + (phead0 ' + orl0).butlast).last].deqID = vs[(orl + (phead0 ' + orl0).butlast).last].deqID ∨ ps[(orl + (phead0 ' + orl0).butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 76 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 77 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + phead0 ' + orl0.butlast).last ', vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + phead0 ' + orl0.butlast).last].next = null, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].next = null, ps[(orl + phead0 ' + orl0.butlast).last].val = vs[(orl + phead0 ' + orl0.butlast).last].val, ps[vs[(orl + phead0 ' + orl0.butlast).last].next] = vs[vs[(orl + phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns((orl + phead0 ' + orl0.butlast).last) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + phead0 ' + orl0.butlast).last ≠ null, (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(orl + phead0 ' + orl0.butlast).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + phead0 ' + orl0.butlast).last ∈ vs, (orl + phead0 ' + orl0.butlast).last ∈ ps, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ vs, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ weak?(vs[(orl + phead0 ' + orl0.butlast).last].deqID), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + phead0 ' + orl0.butlast).last ∈ orl ∨ (orl + phead0 ' + orl0.butlast).last = phead0 ∨ (orl + phead0 ' + orl0.butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), ps[(orl + phead0 ' + orl0.butlast).last].deqID = vs[(orl + phead0 ' + orl0.butlast).last].deqID ∨ ps[(orl + phead0 ' + orl0.butlast).last].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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 78 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (phead0 ' + orl0.butlast).last ', vs[orl0.last].deqID = None, ps[phead0].deqID = None, vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None, vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, vs[vs[(phead0 ' + orl0.butlast).last].next].next = null, ps[(phead0 ' + orl0.butlast).last].val = vs[(phead0 ' + orl0.butlast).last].val, ps[vs[(phead0 ' + orl0.butlast).last].next] = vs[vs[(phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns((phead0 ' + orl0.butlast).last) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl0.butlast).last ≠ orl0.last, (phead0 ' + orl0.butlast).last ≠ null, vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(phead0 ' + orl0.butlast).last].next)), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(phead0 ' + orl0.butlast).last].next ∈ vs, vs[(phead0 ' + orl0.butlast).last].next ∈ ps, (phead0 ' + orl0.butlast).last ∈ orl0, (phead0 ' + orl0.butlast).last ∈ vs, (phead0 ' + orl0.butlast).last ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[(phead0 ' + orl0.butlast).last].deqID), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(phead0 ' + orl0.butlast).last].deqID = vs[(phead0 ' + orl0.butlast).last].deqID ∨ ps[(phead0 ' + orl0.butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 79 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 80 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬(obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 81 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬(obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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

Additional information

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

Proof step 82 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 83 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 84 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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

Additional information

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

Proof step 85 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 86 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 87 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 88 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 89 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 90 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 91 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 92 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 93 from proof fwsim-tau-othertid (previous step) (back to tree)

als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 94 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 37

Additional information

Proof step 95 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 96 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, vhead8

Proof step 97 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 98 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 99 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead0 ≠ (orl + qrl).last, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ⊦ pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None, pc0 = D21 ∧ ps[vhead5].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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, vhead5], <all paths>

Additional information

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

Proof step 100 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 101 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D17, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail:= phead4 = mkgs (ps, ps0, phead, phead0, phead4, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ gstepf(gs, ls, D17, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ D17 ≠ D26; (s) ⊦ D17 ≠ D25; (s) ⊦ D16 ≠ D17; (s) ⊦ D15 ≠ D17; (s) ⊦ D13 ≠ D17; (s) ⊦ D12 ≠ D17; (s) ⊦ D11 ≠ D17; (s) ⊦ D10 ≠ D17; (s) ⊦ D9 ≠ D17; (s) ⊦ D8 ≠ D17; (s) ⊦ D7 ≠ D17; (s) ⊦ D6 ≠ D17; (s) ⊦ D5 ≠ D17; (s) ⊦ D4 ≠ D17; (s) ⊦ D3 ≠ D17; (s) ⊦ D2 ≠ D17; (s) ⊦ D1 ≠ D17; (s) ⊦ D17 ≠ ready; (s) ⊦ D17 ≠ idle; (s) ⊦ D17 ≠ crashed; (s) ⊦ D17 ≠ D19; (s) ⊦ D17 ≠ D18; (s) ⊦ D17 ≠ E17; (s) ⊦ D17 ≠ E16; (s) ⊦ D17 ≠ E15; (s) ⊦ D17 ≠ E14; (s) ⊦ D17 ≠ E13; (s) ⊦ D17 ≠ E12; (s) ⊦ D17 ≠ E11; (s) ⊦ D17 ≠ E10; (s) ⊦ D17 ≠ E9; (s) ⊦ D17 ≠ E8; (s) ⊦ D17 ≠ E7; (s) ⊦ D17 ≠ E6; (s) ⊦ D17 ≠ E5; (s) ⊦ D17 ≠ E4; (s) ⊦ D17 ≠ E3; (s) ⊦ D17 ≠ E2; (s) ⊦ D17 ≠ E1; (s) ⊦ D17 ≠ D20; (s) ⊦ D17 ≠ D31; (s) ⊦ D17 ≠ D30; (s) ⊦ D17 ≠ D29; (s) ⊦ D17 ≠ D28; (s) ⊦ D17 ≠ D27; (s) ⊦ D17 ≠ D24; (s) ⊦ D17 ≠ D23; (s) ⊦ D17 ≠ D22; (s) ⊦ D17 ≠ D21; (s) ⊦ pre(gs, ls, D17, a) ↔ a = τ; (s) ⊦ D17 ≠ D34; (s) ⊦ D14 ≠ D17; (s)

Proof step 102 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → obsEmpty0 → ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 103 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → obsEmpty0 → ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 104 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, obsEmpty0, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 105 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 106 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[phead1].next = null, ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Used simplifier rules: ⊦ 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)

Proof step 107 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, ps0[phead1].next = null, dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead8 = vhead0, ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 108 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vhead0].next = vs0[vhead0].next, ps0[vs0[vhead0].next].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps0), phead ∈ orl, vretRefs(tid) ∈ vrvHp, phead ∈ vs0, phead ∈ ps0, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) Used terms: mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 109 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 110 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 111 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 112 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 113 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[phead1].next = null, ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 114 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 115 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, ps0[phead1].next = null, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead8].next ≠ null, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E11 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D6 → ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E11 = D13 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D14 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D15 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E11 = D16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D17 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D18 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D19 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E11 = D21 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E11 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D25 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D26 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D27 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D29 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D31 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D34 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), E11 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E10 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E11 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E11 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, E11 = E4 ∨ E11 = E10 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D13 ∨ E11 = D14 ∨ E11 = D15 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 ∨ E11 = E1 ∨ E11 = E12 ∨ E11 = E17 → noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), E11 = E10 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), E11 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), E11 = E4 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E11 ≠ E12; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E16; (s) ⊦ E4 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ E1 ≠ E11; (s) ⊦ E11 ≠ ready; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ E17; (s) ⊦ D2 ≠ E11; (s) ⊦ D1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 116 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead1].next = vs[phead1].next, ps[vhead0].next = vs[vhead0].next, ps0[phead1].next = null, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[phead1].next ≠ null, vs[vhead0].next ≠ null, ps[vhead8].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, vs[vs[phead1].next].val, optval1, vs[phead1].next, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid1, owns), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), phead1 ∈ orl ∨ phead1 ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 4

Additional information

Used simplifier rules: ⊦ 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) 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: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 117 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 118 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 119 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 120 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬(obsEmpty0 → ps0[vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 121 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬ ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 122 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬ ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 123 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, ¬(ps0[vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 124 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 125 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 126 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 127 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [(vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 128 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 129 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

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) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s)

Proof step 130 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (als.tid) ]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 131 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 132 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]) ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 133 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 134 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead8 = vhead0, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(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] 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) = 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)

Proof step 135 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, pretRefs(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vretRefs0(tid) ≠ null, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), listp(orl + qrl, vs0, ps0, owns), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), vretRefs0(tid) ∈ vrvHp0, phead ∈ orl, phead ∈ vs0, phead ∈ ps0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vs0[vhead0].next ∧ ps0[vs0[vhead0].next].next = null) ∨ pc0 = E11 ∧ vhead4 = vs0[vhead0].next ∧ ps0[vs0[vhead0].next].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ ¬ obsEmpty0

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 49

Additional information

Proof step 136 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vretRefs0(tid) ≠ null, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ orl, vretRefs0(tid) ∈ vrvHp0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, obsEmpty0 → vhead4 = vs0[vhead0].next ∧ ps0[vs0[vhead0].next].next = null, vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = E10 ∧ ¬ obsEmpty0, pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 137 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vs0[vhead0].next].next = null, ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, pretRefs(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vretRefs0(tid) ≠ null, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ orl, vretRefs0(tid) ∈ vrvHp0, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) Used terms: mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 138 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 139 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vhead0].next = vs0[vhead0].next, ps0[vs0[vhead0].next].next = null, dom vrvHp0 = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vhead4 = vs0[vhead0].next, vs0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vretRefs0(tid) ≠ null, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ orl, vretRefs0(tid) ∈ vrvHp0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = E10 ∧ ¬ obsEmpty0, pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 140 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vs0[vhead0].next].next = null, ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, pretRefs(tid) = vretRefs0(tid), rvowns(vretRefs0(tid)) = Pending(tid), vs0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vretRefs0(tid) ≠ null, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), listp(orl + qrl, vs0, ps0, owns), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), vretRefs0(tid) ∈ vrvHp0, phead ∈ orl, phead ∈ vs0, phead ∈ ps0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) Used terms: mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 141 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 142 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D19, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) 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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns:= rvowns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns0); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = 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) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ gstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]) .rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ); (s) ⊦ D19 ≠ D26; (s) ⊦ D19 ≠ D25; (s) ⊦ D18 ≠ D19; (s) ⊦ D17 ≠ D19; (s) ⊦ D16 ≠ D19; (s) ⊦ D15 ≠ D19; (s) ⊦ D13 ≠ D19; (s) ⊦ D12 ≠ D19; (s) ⊦ D11 ≠ D19; (s) ⊦ D10 ≠ D19; (s) ⊦ D9 ≠ D19; (s) ⊦ D8 ≠ D19; (s) ⊦ D7 ≠ D19; (s) ⊦ D6 ≠ D19; (s) ⊦ D5 ≠ D19; (s) ⊦ D4 ≠ D19; (s) ⊦ D3 ≠ D19; (s) ⊦ D2 ≠ D19; (s) ⊦ D1 ≠ D19; (s) ⊦ D19 ≠ ready; (s) ⊦ D19 ≠ idle; (s) ⊦ D19 ≠ crashed; (s) ⊦ D19 ≠ D33; (s) ⊦ D19 ≠ D32; (s) ⊦ D19 ≠ D31; (s) ⊦ D19 ≠ D30; (s) ⊦ D19 ≠ D29; (s) ⊦ D19 ≠ D28; (s) ⊦ D19 ≠ D27; (s) ⊦ D19 ≠ E17; (s) ⊦ D19 ≠ E16; (s) ⊦ D19 ≠ E15; (s) ⊦ D19 ≠ E14; (s) ⊦ D19 ≠ E13; (s) ⊦ D19 ≠ E12; (s) ⊦ D19 ≠ E11; (s) ⊦ D19 ≠ E10; (s) ⊦ D19 ≠ E9; (s) ⊦ D19 ≠ E8; (s) ⊦ D19 ≠ E7; (s) ⊦ D19 ≠ E6; (s) ⊦ D19 ≠ E5; (s) ⊦ D19 ≠ E4; (s) ⊦ D19 ≠ E3; (s) ⊦ D19 ≠ E2; (s) ⊦ D19 ≠ E1; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ D19 ≠ D24; (s) ⊦ D19 ≠ D23; (s) ⊦ D19 ≠ D22; (s) ⊦ D19 ≠ D21; (s) ⊦ D19 ≠ D20; (s) ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s) ⊦ D19 ≠ D34; (s) ⊦ D14 ≠ D19; (s)

Proof step 143 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 144 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 145 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 146 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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, vhead, phead1, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 147 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬(obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 148 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 149 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 150 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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, vhead, phead1, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 151 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬(vhead4 = phead1 ∧ ps0[phead1].next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 152 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 153 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 154 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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, vhead, phead1, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 155 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬(obsEmpty0 → ps0[vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 156 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 157 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬ ( ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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, vhead, phead1, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 158 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, ¬(ps0[vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 159 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 160 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 161 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 162 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 163 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 164 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

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) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s)

Proof step 165 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (als.tid) ]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 166 from proof fwsim-tau-othertid (previous step) (back to tree)

als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 167 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead7 ∈ orl from vhead2, vhead2 ∈ orl, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]) ⊦

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, vhead, phead1, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, ((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 168 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[ps[vhead2].next].deqID = None ⊃ mkgs (ps, vs[ps[vhead2].next, vs[ps[vhead2].next].deqID:= Some(tid)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns(vretRefs(tid); Claimed(tid, vs[ps[vhead2].next].val))) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead2, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vhead2 ∈ orl, vhead7 ∈ orl from vhead2, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 169 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D21, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl:= qrl1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl1, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl:= qrl2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl2, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps:= ps1 = mkgs (ps1, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ gstepf(gs, ls, D21, a) = ( ( gs .ps:= gs.ps [ls.nxt, gs.ps[ls.nxt].deqID:= gs.vs[ls.nxt].deqID ]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D21 ≠ D26; (s) ⊦ D21 ≠ D25; (s) ⊦ D20 ≠ D21; (s) ⊦ D19 ≠ D21; (s) ⊦ D18 ≠ D21; (s) ⊦ D17 ≠ D21; (s) ⊦ D16 ≠ D21; (s) ⊦ D15 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D9 ≠ D21; (s) ⊦ D8 ≠ D21; (s) ⊦ D7 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D5 ≠ D21; (s) ⊦ D4 ≠ D21; (s) ⊦ D3 ≠ D21; (s) ⊦ D2 ≠ D21; (s) ⊦ D1 ≠ D21; (s) ⊦ D21 ≠ ready; (s) ⊦ D21 ≠ idle; (s) ⊦ D21 ≠ crashed; (s) ⊦ D21 ≠ D33; (s) ⊦ D21 ≠ D32; (s) ⊦ D21 ≠ D31; (s) ⊦ D21 ≠ D30; (s) ⊦ D21 ≠ D29; (s) ⊦ D21 ≠ D28; (s) ⊦ D21 ≠ D27; (s) ⊦ D21 ≠ E17; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E12; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D21 ≠ D22; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ doDeq(tid) ≠ τ; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ pre(gs, ls, D21, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.tid);τ); (s) ⊦ D21 ≠ D34; (s) ⊦ D14 ≠ D21; (s)

Proof step 170 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 171 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 172 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 173 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 174 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 175 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E10 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D6 → ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E10 = D13 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D14 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D15 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E10 = D16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D17 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D18 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D19 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E10 = D21 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E10 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D25 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D26 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D27 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D29 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D31 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D34 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), E10 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E10 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E11 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E10 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, E10 = E4 ∨ E10 = E10 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D13 ∨ E10 = D14 ∨ E10 = D15 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 ∨ E10 = E1 ∨ E10 = E12 ∨ E10 = E17 → noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), E10 = E10 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), E10 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), E10 = E4 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E10 ≠ E11; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ ready; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ E17; (s) ⊦ D2 ≠ E10; (s) ⊦ D1 ≠ E10; (s)

Proof step 176 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vs[vhead8].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, vs[vs[vhead8].next].val, optval1, vs[vhead8].next, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid1, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (ps[vhead8].next ≠ vs[vhead8].next ⊃ oneweakowns(tid1, vs[vhead8].next, owns, vs, ps);noowns(tid1, owns)), ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead8 ∈ orl ∨ vhead8 ∈ qrl) ∧ ps[vhead8].next = vs[vhead8].next, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8

Proof step 177 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 178 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = vhead8 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 179 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), vhead4 = vhead8, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 180 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 181 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 182 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, E11 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D6 → ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E11 = D13 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D14 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D15 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E11 = D16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D17 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D18 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D19 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E11 = D21 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E11 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D25 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D26 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D27 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D29 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D31 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D34 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), E11 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E10 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E11 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E11 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, E11 = E4 ∨ E11 = E10 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D13 ∨ E11 = D14 ∨ E11 = D15 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 ∨ E11 = E1 ∨ E11 = E12 ∨ E11 = E17 → noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), E11 = E10 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), E11 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), E11 = E4 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E11 ≠ E12; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E16; (s) ⊦ E4 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ E1 ≠ E11; (s) ⊦ E11 ≠ ready; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ E17; (s) ⊦ D2 ≠ E11; (s) ⊦ D1 ≠ E11; (s)

Proof step 183 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, vs[vhead8].next ≠ null, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, vs[vs[vhead8].next].val, optval1, vs[vhead8].next, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid1, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, (ps[vhead8].next ≠ vs[vhead8].next ⊃ oneweakowns(tid1, vs[vhead8].next, owns, vs, ps);noowns(tid1, owns)), ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead8 ∈ orl ∨ vhead8 ∈ qrl) ∧ ps[vhead8].next = vs[vhead8].next, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8

Proof step 184 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 185 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 186 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 187 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20

Proof step 188 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 189 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), D20 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = D6 → ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D20 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D20 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D20 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D20 = D12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), D20 = D13 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D20 = D14 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D20 = D15 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, D20 = D16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = D17 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = D18 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D19 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), D20 = D21 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), D20 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D20 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D20 = D25 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D26 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D27 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D29 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D31 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D34 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D20 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), D20 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E10 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D20 = E11 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D20 = E12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, D20 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, D20 = E4 ∨ D20 = E10 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = D13 ∨ D20 = D14 ∨ D20 = D15 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = idle ∨ D20 = ready ∨ D20 = E1 ∨ D20 = E2 ∨ D20 = E3 ∨ D20 = E4 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E10 ∨ D20 = E11 ∨ D20 = E12 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 ∨ D20 = E17 ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = crashed ∨ D20 = idle ∨ D20 = ready ∨ D20 = E1 ∨ D20 = E2 ∨ D20 = E3 ∨ D20 = E4 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E10 ∨ D20 = E11 ∨ D20 = E12 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 ∨ D20 = E17 ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D18 ∨ D20 = D19 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = crashed ∨ D20 = idle ∨ D20 = ready ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 ∨ D20 = E1 ∨ D20 = E12 ∨ D20 = E17 → noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), D20 = E10 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), D20 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), D20 = E4 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = 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] 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 ⊦ D3 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D14 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D19 ≠ D20; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ D20 ≠ D21; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D25; (s) ⊦ D20 ≠ D26; (s) ⊦ D20 ≠ D27; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ D34; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ D33; (s) ⊦ D20 ≠ D32; (s) ⊦ D7 ≠ D20; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ D2 ≠ D20; (s) ⊦ D1 ≠ D20; (s) ⊦ D20 ≠ E17; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ ready; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ crashed; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 190 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead6].next].deqID = Some(tid1), vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), pretRefs(tid1) = vretRefs(tid1), rvowns(vretRefs(tid1)) = Claimed(tid1, vs[ps[vhead6].next].val), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead6].next ≠ null, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][ps[vhead6].next].deqID = None ↔ ps[ps[vhead6].next].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vhead6 ≠ vhead4, vretRefs(tid) ≠ null, vretRefs(tid1) ≠ null, absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, Val(vs[ps[vhead6].next].val), vhead3, nd0, true, vhead4, ps[vhead6].next, vretRefs(tid1), optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid1, orl + qrl, ps[vhead6].next, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), noowns(tid1, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, vretRefs(tid1) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead4, vhead6 ∈ orl, vhead7 ∈ orl from vhead6, vhead6 ∈ vs, vhead6 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ps[ps[vhead6].next].deqID = None → vhead7 = vhead6, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead6 → nextnottid(tid1, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid1) → vhead7 = vhead6, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, vhead4 ∈ orl from vhead6 ∨ vhead4 ∈ qrl ⊦

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), ps[vhead6].next], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), ps[vhead6].next

Proof step 191 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 192 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 193 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead5], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead5

Proof step 194 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 195 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 196 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 197 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 198 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 199 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 200 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vrvHp [mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 201 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 202 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 203 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 44

Additional information

Proof step 204 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 205 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 56

Additional information

Proof step 206 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 207 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead8].next ≠ null, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 208 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 209 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead8].next ≠ null, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E10 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E10 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E10 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E10 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E10 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), E10 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E10 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, E10 = E4 ∨ E10 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D13 ∨ E10 = D14 ∨ E10 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 ∨ E10 = E1 ∨ E10 = E12 ∨ E10 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), E10 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), E10 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), E10 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E10 ≠ E11; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ ready; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ E17; (s) ⊦ D2 ≠ E10; (s) ⊦ D1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 210 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[vhead8].next = vs[vhead8].next, ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vs[vhead8].next ≠ null, vs[vs[vhead8].next].val ≠ val, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid0, vhead7, vs), noid(tid0, orl + qrl, vhead7, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid0, owns), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 ∈ orl ∨ vhead8 ∈ qrl, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8

Proof step 211 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 212 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null, dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), vhead4 = vhead8, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 213 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ps[vhead8].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 214 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 215 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead8].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ps[vhead8].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, E11 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E11 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E11 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E11 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E11 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), E11 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E11 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, E11 = E4 ∨ E11 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D13 ∨ E11 = D14 ∨ E11 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 ∨ E11 = E1 ∨ E11 = E12 ∨ E11 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), E11 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), E11 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), E11 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E11 ≠ E12; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E16; (s) ⊦ E4 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ E1 ≠ E11; (s) ⊦ E11 ≠ ready; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ E17; (s) ⊦ D2 ≠ E11; (s) ⊦ D1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 216 from proof fwsim-tau-othertid (previous step) (back to tree)

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

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), vhead8

Proof step 217 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 218 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D22, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 219 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None ⊦ pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None, pc0 = D21 ∧ ps[vhead5].deqID ≠ None

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 45

Additional information

Proof step 220 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, obsEmpty0, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ D34; (s) ⊦ D6 ≠ D20; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D15 ≠ D20; (s) ⊦ D20 ≠ D22; (s)

Proof step 221 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[vhead5].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20

Proof step 222 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 223 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, D20 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D20 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D20 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D20 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D20 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), D20 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D20 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D20 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, D20 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), D20 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), D20 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D20 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D20 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D20 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), D20 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D20 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D20 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, D20 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, D20 = E4 ∨ D20 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = D13 ∨ D20 = D14 ∨ D20 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = idle ∨ D20 = ready ∨ D20 = E1 ∨ D20 = E2 ∨ D20 = E3 ∨ D20 = E4 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E10 ∨ D20 = E11 ∨ D20 = E12 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 ∨ D20 = E17 ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = crashed ∨ D20 = idle ∨ D20 = ready ∨ D20 = E1 ∨ D20 = E2 ∨ D20 = E3 ∨ D20 = E4 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E10 ∨ D20 = E11 ∨ D20 = E12 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 ∨ D20 = E17 ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D18 ∨ D20 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = crashed ∨ D20 = idle ∨ D20 = ready ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 ∨ D20 = E1 ∨ D20 = E12 ∨ D20 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), D20 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), D20 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), D20 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 ⊦ D3 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D14 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D19 ≠ D20; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ D20 ≠ D21; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D25; (s) ⊦ D20 ≠ D26; (s) ⊦ D20 ≠ D27; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ D34; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ D33; (s) ⊦ D20 ≠ D32; (s) ⊦ D7 ≠ D20; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ D2 ≠ D20; (s) ⊦ D1 ≠ D20; (s) ⊦ D20 ≠ E17; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ ready; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ crashed; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 224 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead6].next].deqID = Some(tid0), ps[ps[vhead6].next].deqID = None, vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid0) = vretRefs(tid0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead6].next].val), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][ps[vhead6].next].deqID ≠ None, ps[vhead6].next ≠ null, ps[vhead2].next ≠ null, optval ≠ Val(vs[ps[vhead6].next].val), orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vhead6 ≠ vhead4, vretRefs(tid0) ≠ null, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead6, vs), noid(tid0, orl + qrl, ps[vhead6].next, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid0, owns), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vhead6 ∈ ps, vhead6 ∈ vs, vhead6 ∈ orl from vhead6, vhead6 ∈ orl, vhead8 ∈ orl + qrl from vhead4, vretRefs(tid0) ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead6].next ≠ null ∧ vs[vs[vhead6].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead6].next].deqID.tid)) = Claimed(vs[vs[vhead6].next].deqID.tid, vs[vs[vhead6].next].val), vhead4 ∈ orl from vhead6 ∨ vhead4 ∈ qrl, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead6 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead6 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), ps[vhead6].next], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), ps[vhead6].next

Proof step 225 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 226 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ D34; (s) ⊦ D6 ≠ D21; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D15 ≠ D21; (s) ⊦ D21 ≠ D22; (s)

Proof step 227 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid), ps[vhead5].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21

Proof step 228 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 229 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2, D21 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D21 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D21 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D21 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D21 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D21 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D21 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D21 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), D21 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D21 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D21 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, D21 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D21 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D21 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), D21 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), D21 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D21 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D21 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D21 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D21 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D21 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D21 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D21 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D21 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D21 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D21 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D21 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), D21 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D21 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D21 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D21 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D21 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D21 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, D21 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E2 ∨ D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, D21 = E4 ∨ D21 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = D13 ∨ D21 = D14 ∨ D21 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E2 ∨ D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D21 = idle ∨ D21 = ready ∨ D21 = E1 ∨ D21 = E2 ∨ D21 = E3 ∨ D21 = E4 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E10 ∨ D21 = E11 ∨ D21 = E12 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 ∨ D21 = E17 ∨ D21 = D1 ∨ D21 = D2 ∨ D21 = D3 ∨ D21 = D4 ∨ D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 ∨ D21 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = crashed ∨ D21 = idle ∨ D21 = ready ∨ D21 = E1 ∨ D21 = E2 ∨ D21 = E3 ∨ D21 = E4 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E10 ∨ D21 = E11 ∨ D21 = E12 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 ∨ D21 = E17 ∨ D21 = D1 ∨ D21 = D2 ∨ D21 = D3 ∨ D21 = D4 ∨ D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 ∨ D21 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D18 ∨ D21 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = D22 ∨ D21 = D23 ∨ D21 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = crashed ∨ D21 = idle ∨ D21 = ready ∨ D21 = D1 ∨ D21 = D2 ∨ D21 = D3 ∨ D21 = D4 ∨ D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 ∨ D21 = D34 ∨ D21 = E1 ∨ D21 = E12 ∨ D21 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), D21 = E2 ∨ D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), D21 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), D21 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), D21 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 ⊦ D3 ≠ D21; (s) ⊦ D4 ≠ D21; (s) ⊦ D5 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D8 ≠ D21; (s) ⊦ D9 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D15 ≠ D21; (s) ⊦ D16 ≠ D21; (s) ⊦ D17 ≠ D21; (s) ⊦ D18 ≠ D21; (s) ⊦ D19 ≠ D21; (s) ⊦ D20 ≠ D21; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ D21 ≠ D22; (s) ⊦ D21 ≠ D23; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D25; (s) ⊦ D21 ≠ D26; (s) ⊦ D21 ≠ D27; (s) ⊦ D21 ≠ D28; (s) ⊦ D21 ≠ D29; (s) ⊦ D21 ≠ D30; (s) ⊦ D21 ≠ D31; (s) ⊦ D21 ≠ D34; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E12; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ D33; (s) ⊦ D21 ≠ D32; (s) ⊦ D7 ≠ D21; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ D2 ≠ D21; (s) ⊦ D1 ≠ D21; (s) ⊦ D21 ≠ E17; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ ready; (s) ⊦ D21 ≠ idle; (s) ⊦ D21 ≠ crashed; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 230 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead6].next].deqID = Some(tid0), ps[ps[vhead6].next].deqID = None, vs[ps[vhead2].next].deqID = Some(tid), dom vrvHp = dom prvHp, pretRefs(tid0) = vretRefs(tid0), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead6].next].val), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid)][ps[vhead6].next].deqID ≠ None, ps[vhead6].next ≠ null, ps[vhead2].next ≠ null, optval ≠ Val(vs[ps[vhead6].next].val), orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vhead6 ≠ vhead4, vretRefs(tid0) ≠ null, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead6, vs), noid(tid0, orl + qrl, ps[vhead6].next, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid0, owns), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vhead6 ∈ ps, vhead6 ∈ vs, vhead6 ∈ orl, vhead8 ∈ orl + qrl from vhead4, vretRefs(tid0) ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead6].next ≠ null ∧ vs[vs[vhead6].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead6].next].deqID.tid)) = Claimed(vs[vs[vhead6].next].deqID.tid, vs[vs[vhead6].next].val), vhead4 ∈ orl from vhead6 ∨ vhead4 ∈ qrl, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead6 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead6 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), ps[vhead6].next], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid), ps[vhead6].next

Proof step 231 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 232 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D22, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp:= vrvHp1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp1, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ gstepf(gs, ls, D22, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, ls.optval]; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D22 ≠ D26; (s) ⊦ D22 ≠ D25; (s) ⊦ D21 ≠ D22; (s) ⊦ D20 ≠ D22; (s) ⊦ D19 ≠ D22; (s) ⊦ D18 ≠ D22; (s) ⊦ D17 ≠ D22; (s) ⊦ D16 ≠ D22; (s) ⊦ D15 ≠ D22; (s) ⊦ D13 ≠ D22; (s) ⊦ D12 ≠ D22; (s) ⊦ D11 ≠ D22; (s) ⊦ D10 ≠ D22; (s) ⊦ D9 ≠ D22; (s) ⊦ D8 ≠ D22; (s) ⊦ D7 ≠ D22; (s) ⊦ D6 ≠ D22; (s) ⊦ D5 ≠ D22; (s) ⊦ D4 ≠ D22; (s) ⊦ D3 ≠ D22; (s) ⊦ D2 ≠ D22; (s) ⊦ D1 ≠ D22; (s) ⊦ D22 ≠ ready; (s) ⊦ D22 ≠ idle; (s) ⊦ D22 ≠ crashed; (s) ⊦ D22 ≠ D33; (s) ⊦ D22 ≠ D32; (s) ⊦ D22 ≠ D31; (s) ⊦ D22 ≠ D30; (s) ⊦ D22 ≠ D29; (s) ⊦ D22 ≠ D28; (s) ⊦ D22 ≠ D27; (s) ⊦ D22 ≠ E17; (s) ⊦ D22 ≠ E16; (s) ⊦ D22 ≠ E15; (s) ⊦ D22 ≠ E14; (s) ⊦ D22 ≠ E13; (s) ⊦ D22 ≠ E12; (s) ⊦ D22 ≠ E11; (s) ⊦ D22 ≠ E10; (s) ⊦ D22 ≠ E9; (s) ⊦ D22 ≠ E8; (s) ⊦ D22 ≠ E7; (s) ⊦ D22 ≠ E6; (s) ⊦ D22 ≠ E5; (s) ⊦ D22 ≠ E4; (s) ⊦ D22 ≠ E3; (s) ⊦ D22 ≠ E2; (s) ⊦ D22 ≠ E1; (s) ⊦ D22 ≠ D24; (s) ⊦ D22 ≠ D23; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ pre(gs, ls, D22, a) ↔ a = τ; (s) ⊦ D22 ≠ D34; (s) ⊦ D14 ≠ D22; (s)

Proof step 233 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 234 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 235 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 236 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 237 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 238 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 239 from proof fwsim-tau-othertid (previous step) (back to tree)

als.oval = vrvHp[vretRefs(als.tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, als.oval ≠ vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)][vretRefs(als.tid)], orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 240 from proof fwsim-tau-othertid (previous step) (back to tree)

als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, optval = vrvHp[vretRefs(tid0)], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)][vretRefs(tid0)], orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 241 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid0)] ≠ vrvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)][vretRefs(tid0)], orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid0)] = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[retval-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vrvHp, vretRefs(tid), Val(vs[ps[vhead2].next].val), vretRefs(tid0)], <all paths>

Additional information

Used simplifier rules: ⊦ rvownerok(vretRefs, vrvHp, rvowns) ∧ tid ≠ tid0 → ( vretRefs(tid) = vretRefs(tid0) ↔ vretRefs(tid) = null ∧ vretRefs(tid0) = null); (as) Used terms: vrvHp, vretRefs(tid), Val(vs[ps[vhead2].next].val), vretRefs(tid0)

Proof step 242 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 243 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D23, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp:= vrvHp2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp2, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ gstepf(gs, ls, D23, τ) = gs.prvHp:= gs.prvHp[ls.rvref, gs.vrvHp[ls.rvref]]; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D23 ≠ D26; (s) ⊦ D23 ≠ D25; (s) ⊦ D22 ≠ D23; (s) ⊦ D21 ≠ D23; (s) ⊦ D20 ≠ D23; (s) ⊦ D19 ≠ D23; (s) ⊦ D18 ≠ D23; (s) ⊦ D17 ≠ D23; (s) ⊦ D16 ≠ D23; (s) ⊦ D15 ≠ D23; (s) ⊦ D13 ≠ D23; (s) ⊦ D12 ≠ D23; (s) ⊦ D11 ≠ D23; (s) ⊦ D10 ≠ D23; (s) ⊦ D9 ≠ D23; (s) ⊦ D8 ≠ D23; (s) ⊦ D7 ≠ D23; (s) ⊦ D6 ≠ D23; (s) ⊦ D5 ≠ D23; (s) ⊦ D4 ≠ D23; (s) ⊦ D3 ≠ D23; (s) ⊦ D2 ≠ D23; (s) ⊦ D1 ≠ D23; (s) ⊦ D23 ≠ ready; (s) ⊦ D23 ≠ idle; (s) ⊦ D23 ≠ crashed; (s) ⊦ D23 ≠ D33; (s) ⊦ D23 ≠ D32; (s) ⊦ D23 ≠ D31; (s) ⊦ D23 ≠ D30; (s) ⊦ D23 ≠ D29; (s) ⊦ D23 ≠ D28; (s) ⊦ D23 ≠ D27; (s) ⊦ D23 ≠ E17; (s) ⊦ D23 ≠ E16; (s) ⊦ D23 ≠ E15; (s) ⊦ D23 ≠ E14; (s) ⊦ D23 ≠ E13; (s) ⊦ D23 ≠ E12; (s) ⊦ D23 ≠ E11; (s) ⊦ D23 ≠ E10; (s) ⊦ D23 ≠ E9; (s) ⊦ D23 ≠ E8; (s) ⊦ D23 ≠ E7; (s) ⊦ D23 ≠ E6; (s) ⊦ D23 ≠ E5; (s) ⊦ D23 ≠ E4; (s) ⊦ D23 ≠ E3; (s) ⊦ D23 ≠ E2; (s) ⊦ D23 ≠ E1; (s) ⊦ D23 ≠ D24; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ pre(gs, ls, D23, a) ↔ a = τ; (s) ⊦ D23 ≠ D34; (s) ⊦ D14 ≠ D23; (s)

Proof step 244 from proof fwsim-tau-othertid (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 245 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 246 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 247 from proof fwsim-tau-othertid (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[vretRefs(tid), Val(vs[ps[vhead2].next].val)], qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 248 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 249 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D24, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead:= phead3 = mkgs (ps, ps0, phead, phead3, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ gstepf(gs, ls, D24, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ D24 ≠ D26; (s) ⊦ D24 ≠ D25; (s) ⊦ D23 ≠ D24; (s) ⊦ D22 ≠ D24; (s) ⊦ D21 ≠ D24; (s) ⊦ D20 ≠ D24; (s) ⊦ D19 ≠ D24; (s) ⊦ D18 ≠ D24; (s) ⊦ D17 ≠ D24; (s) ⊦ D16 ≠ D24; (s) ⊦ D15 ≠ D24; (s) ⊦ D13 ≠ D24; (s) ⊦ D12 ≠ D24; (s) ⊦ D11 ≠ D24; (s) ⊦ D10 ≠ D24; (s) ⊦ D9 ≠ D24; (s) ⊦ D8 ≠ D24; (s) ⊦ D7 ≠ D24; (s) ⊦ D6 ≠ D24; (s) ⊦ D5 ≠ D24; (s) ⊦ D4 ≠ D24; (s) ⊦ D3 ≠ D24; (s) ⊦ D2 ≠ D24; (s) ⊦ D1 ≠ D24; (s) ⊦ D24 ≠ ready; (s) ⊦ D24 ≠ idle; (s) ⊦ D24 ≠ crashed; (s) ⊦ D24 ≠ D33; (s) ⊦ D24 ≠ D32; (s) ⊦ D24 ≠ D31; (s) ⊦ D24 ≠ D30; (s) ⊦ D24 ≠ D29; (s) ⊦ D24 ≠ D28; (s) ⊦ D24 ≠ D27; (s) ⊦ D24 ≠ E17; (s) ⊦ D24 ≠ E16; (s) ⊦ D24 ≠ E15; (s) ⊦ D24 ≠ E14; (s) ⊦ D24 ≠ E13; (s) ⊦ D24 ≠ E12; (s) ⊦ D24 ≠ E11; (s) ⊦ D24 ≠ E10; (s) ⊦ D24 ≠ E9; (s) ⊦ D24 ≠ E8; (s) ⊦ D24 ≠ E7; (s) ⊦ D24 ≠ E6; (s) ⊦ D24 ≠ E5; (s) ⊦ D24 ≠ E4; (s) ⊦ D24 ≠ E3; (s) ⊦ D24 ≠ E2; (s) ⊦ D24 ≠ E1; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ pre(gs, ls, D24, a) ↔ a = τ; (s) ⊦ D24 ≠ D34; (s) ⊦ D14 ≠ D24; (s)

Proof step 250 from proof fwsim-tau-othertid (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 251 from proof fwsim-tau-othertid (previous step) (back to tree)

prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 252 from proof fwsim-tau-othertid (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 253 from proof fwsim-tau-othertid (previous step) (back to tree)

prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And closed the goal!

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E4; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ D6 ≠ D20; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E4; (s)

Proof step 254 from proof fwsim-tau-othertid (previous step) (back to tree)

prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 255 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 256 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 257 from proof fwsim-tau-othertid (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [(vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 258 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 259 from proof fwsim-tau-othertid (previous step) (back to tree)

prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

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) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s)

Proof step 260 from proof fwsim-tau-othertid (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (als.tid) ]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 261 from proof fwsim-tau-othertid (previous step) (back to tree)

prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 262 from proof fwsim-tau-othertid (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]) ⊦

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, vhead, phead1, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 263 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 42

Additional information

Proof step 264 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 265 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 57

Additional information

Proof step 266 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 267 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[phead1].next = null, (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ phead1 = vhead8 ∧ ps[vhead8].next = null

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 268 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[phead1].next = null, (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), vhead4 = phead1, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 269 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[phead1].next = null, (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ phead1 = vhead8 ∧ ps[vhead8].next = null

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 270 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 271 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ⊦ pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None, pc0 = D21 ∧ ps[vhead5].deqID ≠ None

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 272 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, optval ≠ vrvHp0[vretRefs0(tid0)], orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 273 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vrvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), prvHp[vretRefs(tid)] = Val(vs[ps[vhead2].next].val), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid0)] ≠ vrvHp0[vretRefs0(tid0)], orl ≠ [], tid ≠ tid0, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, ps[vhead2].next, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid0)] = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 274 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D28, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) 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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl:= qrl1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl1, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl:= qrl2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl2, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps:= ps1 = mkgs (ps1, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .othertid = tid0; (s) ⊦ gstepf(gs, ls, D28, a) = ( ( gs .ps:= gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D26 ≠ D28; (s) ⊦ D25 ≠ D28; (s) ⊦ D27 ≠ D28; (s) ⊦ D24 ≠ D28; (s) ⊦ D23 ≠ D28; (s) ⊦ D22 ≠ D28; (s) ⊦ D21 ≠ D28; (s) ⊦ D20 ≠ D28; (s) ⊦ D19 ≠ D28; (s) ⊦ D18 ≠ D28; (s) ⊦ D17 ≠ D28; (s) ⊦ D16 ≠ D28; (s) ⊦ D15 ≠ D28; (s) ⊦ D13 ≠ D28; (s) ⊦ D12 ≠ D28; (s) ⊦ D11 ≠ D28; (s) ⊦ D10 ≠ D28; (s) ⊦ D9 ≠ D28; (s) ⊦ D8 ≠ D28; (s) ⊦ D7 ≠ D28; (s) ⊦ D6 ≠ D28; (s) ⊦ D5 ≠ D28; (s) ⊦ D4 ≠ D28; (s) ⊦ D3 ≠ D28; (s) ⊦ D2 ≠ D28; (s) ⊦ D1 ≠ D28; (s) ⊦ D28 ≠ ready; (s) ⊦ D28 ≠ idle; (s) ⊦ D28 ≠ crashed; (s) ⊦ D28 ≠ E17; (s) ⊦ D28 ≠ E16; (s) ⊦ D28 ≠ E15; (s) ⊦ D28 ≠ E14; (s) ⊦ D28 ≠ E13; (s) ⊦ D28 ≠ E12; (s) ⊦ D28 ≠ E11; (s) ⊦ D28 ≠ E10; (s) ⊦ D28 ≠ E9; (s) ⊦ D28 ≠ E8; (s) ⊦ D28 ≠ E7; (s) ⊦ D28 ≠ E6; (s) ⊦ D28 ≠ E5; (s) ⊦ D28 ≠ E4; (s) ⊦ D28 ≠ E3; (s) ⊦ D28 ≠ E2; (s) ⊦ D28 ≠ E1; (s) ⊦ D28 ≠ D31; (s) ⊦ D28 ≠ D30; (s) ⊦ D28 ≠ D29; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ doDeq(tid) ≠ τ; (s) ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ D28 ≠ D34; (s) ⊦ D14 ≠ D28; (s)

Proof step 275 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 276 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 277 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), addr ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 278 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8

Proof step 279 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 280 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = vhead8 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 281 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), vhead4 = vhead8, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ ps[vhead8].next = null), addr ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 282 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ↔ ps[vhead8].next = null), addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8

Proof step 283 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 284 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 285 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), addr ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 286 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(obsEmpty0 → ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5

Proof step 287 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 288 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ ps[vhead5].deqID = None), addr ≠ null, orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 289 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID = None ↔ ps[vhead5].deqID = None), addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5

Proof step 290 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 291 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 292 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 293 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 294 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 295 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 296 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vrvHp [mkgs (ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 297 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ als.tid, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid1, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid1, optval

Proof step 298 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), als = mkls(tid1, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 299 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 46

Additional information

Proof step 300 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 301 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid1, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 58

Additional information

Proof step 302 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid1, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, obsEmpty0 → vhead4 = vhead8 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 303 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead8].next ≠ null, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8

Proof step 304 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 305 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null, dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), vhead4 = vhead8, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid1, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 306 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead8].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ps[vhead8].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, val0 ≠ val, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).next = nd.next; (s) Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead8

Proof step 307 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 308 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D22, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 309 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D20 ∧ obsEmpty0 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None ⊦ pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None, pc0 = D21 ∧ ps[vhead5].deqID ≠ None

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 47

Additional information

Proof step 310 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, obsEmpty0, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ D34; (s) ⊦ D6 ≠ D20; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D15 ≠ D20; (s) ⊦ D20 ≠ D22; (s)

Proof step 311 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), ps[vhead5].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5], <all paths>

Additional information

Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5

Proof step 312 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 313 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead8 ∈ orl + qrl from vhead0, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid1)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ D34; (s) ⊦ D6 ≠ D21; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D15 ≠ D21; (s) ⊦ D21 ≠ D22; (s)

Proof step 314 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].deqID = Some(tid0), ps[vhead5].deqID = None, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0)][vhead5].deqID ≠ None, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid1, vhead2 ≠ vhead0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, vhead8 ∈ orl + qrl from vhead0, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl from vhead2 ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5], <all paths>

Additional information

Used terms: ps, ps[vhead2].next, ps[ps[vhead2].next].deqID:= Some(tid0), vhead5

Proof step 315 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 316 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D29, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) 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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp:= vrvHp1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp1, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .addr = rvref0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ gstepf(gs, ls, D29, τ) = gs.vrvHp:= gs.vrvHp[ls.addr, ls.optval]; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D26 ≠ D29; (s) ⊦ D25 ≠ D29; (s) ⊦ D28 ≠ D29; (s) ⊦ D27 ≠ D29; (s) ⊦ D24 ≠ D29; (s) ⊦ D23 ≠ D29; (s) ⊦ D22 ≠ D29; (s) ⊦ D21 ≠ D29; (s) ⊦ D20 ≠ D29; (s) ⊦ D19 ≠ D29; (s) ⊦ D18 ≠ D29; (s) ⊦ D17 ≠ D29; (s) ⊦ D16 ≠ D29; (s) ⊦ D15 ≠ D29; (s) ⊦ D13 ≠ D29; (s) ⊦ D12 ≠ D29; (s) ⊦ D11 ≠ D29; (s) ⊦ D10 ≠ D29; (s) ⊦ D9 ≠ D29; (s) ⊦ D8 ≠ D29; (s) ⊦ D7 ≠ D29; (s) ⊦ D6 ≠ D29; (s) ⊦ D5 ≠ D29; (s) ⊦ D4 ≠ D29; (s) ⊦ D3 ≠ D29; (s) ⊦ D2 ≠ D29; (s) ⊦ D1 ≠ D29; (s) ⊦ D29 ≠ ready; (s) ⊦ D29 ≠ idle; (s) ⊦ D29 ≠ crashed; (s) ⊦ D29 ≠ E17; (s) ⊦ D29 ≠ E16; (s) ⊦ D29 ≠ E15; (s) ⊦ D29 ≠ E14; (s) ⊦ D29 ≠ E13; (s) ⊦ D29 ≠ E12; (s) ⊦ D29 ≠ E11; (s) ⊦ D29 ≠ E10; (s) ⊦ D29 ≠ E9; (s) ⊦ D29 ≠ E8; (s) ⊦ D29 ≠ E7; (s) ⊦ D29 ≠ E6; (s) ⊦ D29 ≠ E5; (s) ⊦ D29 ≠ E4; (s) ⊦ D29 ≠ E3; (s) ⊦ D29 ≠ E2; (s) ⊦ D29 ≠ E1; (s) ⊦ D29 ≠ D31; (s) ⊦ D29 ≠ D30; (s) ⊦ pre(gs, ls, D29, a) ↔ a = τ; (s) ⊦ D29 ≠ D34; (s) ⊦ D14 ≠ D29; (s)

Proof step 317 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 318 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 319 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 320 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 321 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 322 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp[addr, Val(vs[ps[vhead2].next].val)], prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 323 from proof fwsim-tau-othertid (previous step) (back to tree)

als.oval = vrvHp[vretRefs(als.tid)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, als.oval ≠ vrvHp[addr, Val(vs[ps[vhead2].next].val)][vretRefs(als.tid)], addr ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid1, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid1, optval

Proof step 324 from proof fwsim-tau-othertid (previous step) (back to tree)

als = mkls(tid1, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, optval = vrvHp[vretRefs(tid1)], pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, optval ≠ vrvHp[addr, Val(vs[ps[vhead2].next].val)][vretRefs(tid1)], orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 325 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid1)] ≠ vrvHp[addr, Val(vs[ps[vhead2].next].val)][vretRefs(tid1)], addr ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid1)] = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[retval-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vrvHp, addr, Val(vs[ps[vhead2].next].val), vretRefs(tid1)], <all paths>

Additional information

Used terms: vrvHp, addr, Val(vs[ps[vhead2].next].val), vretRefs(tid1)

Proof step 326 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 327 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), vretRefs(tid1) = addr, ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid1)] ≠ vrvHp[addr, Val(vs[ps[vhead2].next].val)][vretRefs(tid1)], addr ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid1)] = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s)

Proof step 328 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], tid ≠ tid1, vretRefs(tid1) ≠ null, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid1) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid1)] = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0

Proof step 329 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 330 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], tid ≠ tid1, vretRefs(tid1) ≠ null, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid1) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid1)] = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, pc0 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, pc0 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = D6 → ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), pc0 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, pc0 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, pc0 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), pc0 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), pc0 = D12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), pc0 = D13 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, pc0 = D14 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, pc0 = D15 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, pc0 = D16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = D17 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = D18 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, pc0 = D19 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), pc0 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), pc0 = D21 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), pc0 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, pc0 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], pc0 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], pc0 = D25 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), pc0 = D26 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), pc0 = D27 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), pc0 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), pc0 = D29 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), pc0 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), pc0 = D31 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, pc0 = D34 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), pc0 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), pc0 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), pc0 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), pc0 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), pc0 = E10 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), pc0 = E11 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), pc0 = E12 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, pc0 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, pc0 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, pc0 = E4 ∨ pc0 = E10 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D18 ∨ pc0 = D19 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → noid (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D4 ∨ pc0 = D5 ∨ pc0 = D6 ∨ pc0 = D7 ∨ pc0 = D8 ∨ pc0 = D9 ∨ pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14 ∨ pc0 = D15 ∨ pc0 = D16 ∨ pc0 = D17 ∨ pc0 = D18 ∨ pc0 = D19 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D25 ∨ pc0 = D26 ∨ pc0 = D27 ∨ pc0 = D28 ∨ pc0 = D29 ∨ pc0 = D30 ∨ pc0 = D31 ∨ pc0 = D32 ∨ pc0 = D33 ∨ pc0 = D34 ∨ pc0 = E1 ∨ pc0 = E12 ∨ pc0 = E17 → noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), pc0 = E10 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), pc0 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), pc0 = E4 → (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Pending(tid) ≠ Claimed(tid0, val); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .othertid = tid0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .addr = rvref0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s)

Proof step 331 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], pc0 ≠ D4, pc0 ≠ D5, pc0 ≠ D7, pc0 ≠ D8, pc0 ≠ D9, pc0 ≠ D10, pc0 ≠ D11, pc0 ≠ D12, pc0 ≠ D16, pc0 ≠ D17, pc0 ≠ D18, pc0 ≠ D19, pc0 ≠ D25, pc0 ≠ D26, pc0 ≠ D27, pc0 ≠ D28, pc0 ≠ D29, pc0 ≠ D30, pc0 ≠ D31, pc0 ≠ D32, pc0 ≠ D33, pc0 ≠ D13, pc0 ≠ D14, pc0 ≠ D15, tid ≠ tid1, vretRefs(tid) ≠ null, vretRefs(tid1) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid1) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ¬ obsEmpty0, pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → obsEmpty0 ∧ Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, vs[vhead5].val) ∧ optval1 = Val(vs[vhead5].val), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead7 ≠ vhead6 → nextnottid(tid1, vhead7, vs), pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → noid(tid1, orl + qrl, vhead5, vs), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → oneowns(tid1, vhead3, owns, vs, ps), pc0 = E10 → (obsEmpty0 ⊃ (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid1, vhead3, owns, vs, ps);noowns(tid1, owns));oneowns(tid1, vhead3, owns, vs, ps)), pc0 = E11 → (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid1, vhead3, owns, vs, ps);noowns(tid1, owns)), pc0 = E4 → (obsEmpty0 ⊃ noowns(tid1, owns);oneowns(tid1, vhead3, owns, vs, ps)), pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid1)] = optval1, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D3 → rvowns(rvref0) = Pending(tid1) ∧ rvref0 ∈ vrvHp ∧ rvref0 ∈ prvHp ∧ rvref0 ≠ null, pc0 = D6 → (obsEmpty0 → optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0]) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = (optval1 = Empty ∨ ¬ obsEmpty0 ⊃ Pending(tid1);Claimed(tid1, optval1.val)), pc0 = D21 → ps[vhead6].next ≠ null ∧ vhead6 ∈ orl ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID = Some(tid1) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid1, orl + qrl, ps[vhead6].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid1) → vhead7 = vhead6), pc0 = D22 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next, pc0 = D23 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0], pc0 = D24 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0], pc0 = D34 → optval1 = vrvHp[vretRefs(tid1)] ∧ vrvHp[vretRefs(tid1)] = prvHp[pretRefs(tid1)] ∧ vretRefs(tid1) = pretRefs(tid1) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = (vrvHp[vretRefs(tid1)] = Empty ⊃ Pending(tid1);Claimed(tid1, vrvHp[vretRefs(tid1)].val)), pc0 = E2 → owns(vhead3) = Some(tid1), pc0 = E3 → owns(vhead3) = Some(tid1), pc0 = E5 → owns(vhead3) = Some(tid1), pc0 = E6 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (ps[vhead4].next = null → vhead4 = vhead8), pc0 = E7 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E8 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E9 → owns(vhead3) = Some(tid1) ∧ vhead5 = null ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E10 → obsEmpty0 → vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E11 → obsEmpty0 ∧ vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E12 → obsEmpty0 ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next ∈ orl ∨ vs[vhead4].next ∈ qrl) ∧ vs[vhead4].next = vhead3 ∧ ps[vhead4].next = vs[vhead4].next ∧ vs[vhead4].next ∈ ps ∧ vs[vhead4].next ∈ vs ∧ vs[vhead4].next ≠ null, pc0 = E13 → owns(vhead3) = Some(tid1), pc0 = E14 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E15 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next = ps[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E16 → owns(vhead3) = Some(tid1), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ vhead3 ≠ null ∧ ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl, pc0 = E4 ∨ pc0 = E10 → ¬ obsEmpty0 → ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl ∧ vhead3 ≠ null ∧ vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ owns(vhead3) = Some(tid1) ∧ vs[vhead3] = mk(val0, None, null) ∧ ps[vhead3] = vs[vhead3], pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vs[vhead3] = mk(val0, None, null), pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ps[vhead3] = vs[vhead3], pc0 = D20 → vhead6 ∈ orl ∧ vhead7 ∈ orl from vhead6, pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead6 ≠ vhead4 ∧ vhead8 ∈ orl + qrl from vhead4, pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead4 ∈ orl + qrl from vhead6, pc0 = D6 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vretRefs(tid1) = rvref0 ∧ pretRefs(tid1) = vretRefs(tid1), pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D34 → nextnottid(tid1, vhead7, vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D34 → noid(tid1, orl + qrl, vhead7, vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D34 ∨ pc0 = E1 ∨ pc0 = E12 ∨ pc0 = E17 → noowns(tid1, owns), pc0 = D20 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = Val(vs[ps[vhead6].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid1) → vhead7 = vhead6) ∧ obsEmpty0 ∧ vs[ps[vhead6].next].deqID = Some(tid1) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, vs[ps[vhead6].next].val) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid1, orl + qrl, ps[vhead6].next, vs), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 105

Additional information

Used simplifier rules: ⊦ D4 ≠ D24; (s) ⊦ D5 ≠ D24; (s) ⊦ D7 ≠ D24; (s) ⊦ D8 ≠ D24; (s) ⊦ D9 ≠ D24; (s) ⊦ D10 ≠ D24; (s) ⊦ D11 ≠ D24; (s) ⊦ D12 ≠ D24; (s) ⊦ D16 ≠ D24; (s) ⊦ D17 ≠ D24; (s) ⊦ D18 ≠ D24; (s) ⊦ D19 ≠ D24; (s) ⊦ D24 ≠ D25; (s) ⊦ D24 ≠ D26; (s) ⊦ D24 ≠ D27; (s) ⊦ D24 ≠ D28; (s) ⊦ D24 ≠ D29; (s) ⊦ D24 ≠ D30; (s) ⊦ D24 ≠ D31; (s) ⊦ D24 ≠ D32; (s) ⊦ D24 ≠ D33; (s) ⊦ D13 ≠ D24; (s) ⊦ D14 ≠ D24; (s) ⊦ D15 ≠ D24; (s) ⊦ Claimed(tid, val) = Claimed(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D24 ≠ E1; (s) ⊦ D24 ≠ E2; (s) ⊦ D24 ≠ E3; (s) ⊦ D24 ≠ E4; (s) ⊦ D24 ≠ E5; (s) ⊦ D24 ≠ E6; (s) ⊦ D24 ≠ E7; (s) ⊦ D24 ≠ E8; (s) ⊦ D24 ≠ E9; (s) ⊦ D24 ≠ E10; (s) ⊦ D24 ≠ E11; (s) ⊦ D24 ≠ E12; (s) ⊦ D24 ≠ E13; (s) ⊦ D24 ≠ E14; (s) ⊦ D24 ≠ E15; (s) ⊦ D24 ≠ E16; (s) ⊦ D24 ≠ E17; (s) ⊦ D24 ≠ D34; (s) ⊦ D24 ≠ crashed; (s) ⊦ D24 ≠ idle; (s) ⊦ D24 ≠ ready; (s) ⊦ D1 ≠ D24; (s) ⊦ D2 ≠ D24; (s) ⊦ D3 ≠ D24; (s) ⊦ D6 ≠ D24; (s) ⊦ D21 ≠ D24; (s) ⊦ D22 ≠ D24; (s) ⊦ D23 ≠ D24; (s) ⊦ D20 ≠ D24; (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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D4 ≠ D23; (s) ⊦ D5 ≠ D23; (s) ⊦ D7 ≠ D23; (s) ⊦ D8 ≠ D23; (s) ⊦ D9 ≠ D23; (s) ⊦ D10 ≠ D23; (s) ⊦ D11 ≠ D23; (s) ⊦ D12 ≠ D23; (s) ⊦ D16 ≠ D23; (s) ⊦ D17 ≠ D23; (s) ⊦ D18 ≠ D23; (s) ⊦ D19 ≠ D23; (s) ⊦ D23 ≠ D25; (s) ⊦ D23 ≠ D26; (s) ⊦ D23 ≠ D27; (s) ⊦ D23 ≠ D28; (s) ⊦ D23 ≠ D29; (s) ⊦ D23 ≠ D30; (s) ⊦ D23 ≠ D31; (s) ⊦ D23 ≠ D32; (s) ⊦ D23 ≠ D33; (s) ⊦ D13 ≠ D23; (s) ⊦ D14 ≠ D23; (s) ⊦ D15 ≠ D23; (s) ⊦ D23 ≠ E1; (s) ⊦ D23 ≠ E2; (s) ⊦ D23 ≠ E3; (s) ⊦ D23 ≠ E4; (s) ⊦ D23 ≠ E5; (s) ⊦ D23 ≠ E6; (s) ⊦ D23 ≠ E7; (s) ⊦ D23 ≠ E8; (s) ⊦ D23 ≠ E9; (s) ⊦ D23 ≠ E10; (s) ⊦ D23 ≠ E11; (s) ⊦ D23 ≠ E12; (s) ⊦ D23 ≠ E13; (s) ⊦ D23 ≠ E14; (s) ⊦ D23 ≠ E15; (s) ⊦ D23 ≠ E16; (s) ⊦ D23 ≠ E17; (s) ⊦ D23 ≠ D34; (s) ⊦ D23 ≠ crashed; (s) ⊦ D23 ≠ idle; (s) ⊦ D23 ≠ ready; (s) ⊦ D1 ≠ D23; (s) ⊦ D2 ≠ D23; (s) ⊦ D3 ≠ D23; (s) ⊦ D6 ≠ D23; (s) ⊦ D21 ≠ D23; (s) ⊦ D22 ≠ D23; (s) ⊦ D20 ≠ D23; (s)

Proof step 332 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, obsEmpty0, pc0 = D6, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], pc0 ≠ D4, pc0 ≠ D5, pc0 ≠ D7, pc0 ≠ D8, pc0 ≠ D9, pc0 ≠ D10, pc0 ≠ D11, pc0 ≠ D12, pc0 ≠ D16, pc0 ≠ D17, pc0 ≠ D18, pc0 ≠ D19, pc0 ≠ D25, pc0 ≠ D26, pc0 ≠ D27, pc0 ≠ D28, pc0 ≠ D29, pc0 ≠ D30, pc0 ≠ D31, pc0 ≠ D32, pc0 ≠ D33, pc0 ≠ D13, pc0 ≠ D14, pc0 ≠ D15, tid ≠ tid1, vretRefs(tid) ≠ null, vretRefs(tid1) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid1) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), pc0 = D20 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = Val(vs[ps[vhead6].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid1) → vhead7 = vhead6) ∧ obsEmpty0 ∧ vs[ps[vhead6].next].deqID = Some(tid1) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, vs[ps[vhead6].next].val) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid1, orl + qrl, ps[vhead6].next, vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D34 ∨ pc0 = E1 ∨ pc0 = E12 ∨ pc0 = E17 → noowns(tid1, owns), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D34 → noid(tid1, orl + qrl, vhead7, vs), pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D34 → nextnottid(tid1, vhead7, vs), pc0 = D6 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vretRefs(tid1) = rvref0 ∧ pretRefs(tid1) = vretRefs(tid1), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead4 ∈ orl + qrl from vhead6, pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead6 ≠ vhead4 ∧ vhead8 ∈ orl + qrl from vhead4, pc0 = D20 → vhead6 ∈ orl ∧ vhead7 ∈ orl from vhead6, pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ps[vhead3] = vs[vhead3], pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vs[vhead3] = mk(val0, None, null), pc0 = E4 ∨ pc0 = E10 → ¬ obsEmpty0 → ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl ∧ vhead3 ≠ null ∧ vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ owns(vhead3) = Some(tid1) ∧ vs[vhead3] = mk(val0, None, null) ∧ ps[vhead3] = vs[vhead3], pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ vhead3 ≠ null ∧ ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl, pc0 = E16 → owns(vhead3) = Some(tid1), pc0 = E15 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next = ps[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E14 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E13 → owns(vhead3) = Some(tid1), pc0 = E12 → obsEmpty0 ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next ∈ orl ∨ vs[vhead4].next ∈ qrl) ∧ vs[vhead4].next = vhead3 ∧ ps[vhead4].next = vs[vhead4].next ∧ vs[vhead4].next ∈ ps ∧ vs[vhead4].next ∈ vs ∧ vs[vhead4].next ≠ null, pc0 = E11 → obsEmpty0 ∧ vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E10 → obsEmpty0 → vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E9 → owns(vhead3) = Some(tid1) ∧ vhead5 = null ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E8 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E7 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E6 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (ps[vhead4].next = null → vhead4 = vhead8), pc0 = E5 → owns(vhead3) = Some(tid1), pc0 = E3 → owns(vhead3) = Some(tid1), pc0 = E2 → owns(vhead3) = Some(tid1), pc0 = D34 → optval1 = vrvHp[vretRefs(tid1)] ∧ vrvHp[vretRefs(tid1)] = prvHp[pretRefs(tid1)] ∧ vretRefs(tid1) = pretRefs(tid1) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = (vrvHp[vretRefs(tid1)] = Empty ⊃ Pending(tid1);Claimed(tid1, vrvHp[vretRefs(tid1)].val)), pc0 = D24 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0], pc0 = D23 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0], pc0 = D22 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next, pc0 = D21 → ps[vhead6].next ≠ null ∧ vhead6 ∈ orl ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID = Some(tid1) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid1, orl + qrl, ps[vhead6].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid1) → vhead7 = vhead6), pc0 = D6 → (obsEmpty0 → optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0]) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = (optval1 = Empty ∨ ¬ obsEmpty0 ⊃ Pending(tid1);Claimed(tid1, optval1.val)), pc0 = D3 → rvowns(rvref0) = Pending(tid1) ∧ rvref0 ∈ vrvHp ∧ rvref0 ∈ prvHp ∧ rvref0 ≠ null, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid1)] = optval1, pc0 = E4 → (obsEmpty0 ⊃ noowns(tid1, owns);oneowns(tid1, vhead3, owns, vs, ps)), pc0 = E11 → (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid1, vhead3, owns, vs, ps);noowns(tid1, owns)), pc0 = E10 → (obsEmpty0 ⊃ (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid1, vhead3, owns, vs, ps);noowns(tid1, owns));oneowns(tid1, vhead3, owns, vs, ps)), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → oneowns(tid1, vhead3, owns, vs, ps), pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → noid(tid1, orl + qrl, vhead5, vs), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead7 ≠ vhead6 → nextnottid(tid1, vhead7, vs), pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → obsEmpty0 ∧ Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, vs[vhead5].val) ∧ optval1 = Val(vs[vhead5].val), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ¬ obsEmpty0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D6 ≠ D20; (s) ⊦ D3 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D1 ≠ D6; (s) ⊦ D6 ≠ ready; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E4; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D7; (s) ⊦ D5 ≠ D6; (s) ⊦ D4 ≠ D6; (s)

Proof step 333 from proof fwsim-tau-othertid (previous step) (back to tree)

Claimed(tid0, vs[ps[vhead2].next].val) = (prvHp[vretRefs(tid1)] = Empty ⊃ Pending(tid1);Claimed(tid1, prvHp[vretRefs(tid1)].val)), vrvHp[vretRefs(tid1)] = prvHp[vretRefs(tid1)], dom vrvHp = dom prvHp, pretRefs(tid1) = vretRefs(tid1), pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, prvHp[vretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], tid ≠ tid1, vretRefs(tid1) ≠ null, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid1, owns), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid1) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ Pending(tid) ≠ Claimed(tid0, val); (s)

Proof step 334 from proof fwsim-tau-othertid (previous step) (back to tree)

Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, prvHp[vretRefs(tid1)].val), vrvHp[vretRefs(tid1)] = prvHp[vretRefs(tid1)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), pretRefs(tid1) = vretRefs(tid1), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, prvHp[vretRefs(tid1)] ≠ Empty, prvHp[vretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], tid ≠ tid1, vretRefs(tid1) ≠ null, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), noowns(tid1, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid1) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Claimed(tid, val) = Claimed(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws)

Proof step 335 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].val = prvHp[vretRefs(tid1)].val, vrvHp[vretRefs(tid1)] = prvHp[vretRefs(tid1)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), pretRefs(tid1) = vretRefs(tid1), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid1)) = Claimed(tid1, prvHp[vretRefs(tid1)].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, prvHp[vretRefs(tid1)] ≠ Val(prvHp[vretRefs(tid1)].val), prvHp[vretRefs(tid1)] ≠ Empty, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, vretRefs(tid1) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), noowns(tid1, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid1) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: optelem, name:elim-Val, seq: ⊦ optval ≠ Empty → (val = optval.val ↔ optval = Val(val)), subst:[optval, val] → [prvHp[vretRefs(tid1)], val]

Additional information

Used simplifier rules: ⊦ optval ≠ Empty → (val = optval.val ↔ optval = Val(val)); (elim) Used terms: prvHp[vretRefs(tid1)], val

Proof step 336 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = D34, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, vrvHp[vretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], pc0 ≠ D4, pc0 ≠ D5, pc0 ≠ D7, pc0 ≠ D8, pc0 ≠ D9, pc0 ≠ D10, pc0 ≠ D11, pc0 ≠ D12, pc0 ≠ D16, pc0 ≠ D17, pc0 ≠ D18, pc0 ≠ D19, pc0 ≠ D25, pc0 ≠ D26, pc0 ≠ D27, pc0 ≠ D28, pc0 ≠ D29, pc0 ≠ D30, pc0 ≠ D31, pc0 ≠ D32, pc0 ≠ D33, pc0 ≠ D13, pc0 ≠ D14, pc0 ≠ D15, tid ≠ tid1, vretRefs(tid) ≠ null, vretRefs(tid1) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vretRefs(tid1) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), pc0 = D20 → ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = Val(vs[ps[vhead6].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid1) → vhead7 = vhead6) ∧ obsEmpty0 ∧ vs[ps[vhead6].next].deqID = Some(tid1) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, vs[ps[vhead6].next].val) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid1, orl + qrl, ps[vhead6].next, vs), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D34 ∨ pc0 = E1 ∨ pc0 = E12 ∨ pc0 = E17 → noowns(tid1, owns), pc0 = crashed ∨ pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D34 → noid(tid1, orl + qrl, vhead7, vs), pc0 = idle ∨ pc0 = ready ∨ pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∨ pc0 = E11 ∨ pc0 = E12 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 ∨ pc0 = E17 ∨ pc0 = D1 ∨ pc0 = D2 ∨ pc0 = D3 ∨ pc0 = D6 ∨ pc0 = D34 → nextnottid(tid1, vhead7, vs), pc0 = D6 ∨ pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vretRefs(tid1) = rvref0 ∧ pretRefs(tid1) = vretRefs(tid1), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead4 ∈ orl + qrl from vhead6, pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead6 ≠ vhead4 ∧ vhead8 ∈ orl + qrl from vhead4, pc0 = D20 → vhead6 ∈ orl ∧ vhead7 ∈ orl from vhead6, pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ps[vhead3] = vs[vhead3], pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vs[vhead3] = mk(val0, None, null), pc0 = E4 ∨ pc0 = E10 → ¬ obsEmpty0 → ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl ∧ vhead3 ≠ null ∧ vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ owns(vhead3) = Some(tid1) ∧ vs[vhead3] = mk(val0, None, null) ∧ ps[vhead3] = vs[vhead3], pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → vhead3 ∈ ps ∧ vhead3 ∈ vs ∧ vhead3 ≠ null ∧ ¬ vhead3 ∈ orl ∧ ¬ vhead3 ∈ qrl, pc0 = E16 → owns(vhead3) = Some(tid1), pc0 = E15 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next = ps[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E14 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ vhead5 = vs[vhead4].next ∧ vs[vhead4].next ≠ null, pc0 = E13 → owns(vhead3) = Some(tid1), pc0 = E12 → obsEmpty0 ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next ∈ orl ∨ vs[vhead4].next ∈ qrl) ∧ vs[vhead4].next = vhead3 ∧ ps[vhead4].next = vs[vhead4].next ∧ vs[vhead4].next ∈ ps ∧ vs[vhead4].next ∈ vs ∧ vs[vhead4].next ≠ null, pc0 = E11 → obsEmpty0 ∧ vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E10 → obsEmpty0 → vs[vhead4].next = vhead3 ∧ vs[vhead4].next ≠ null ∧ vs[vs[vhead4].next].val = val0 ∧ (vhead4 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid1) ∨ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ ps[vhead4].next = vs[vhead4].next), pc0 = E9 → owns(vhead3) = Some(tid1) ∧ vhead5 = null ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E8 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E7 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (vhead5 ≠ null → vhead5 = vs[vhead4].next) ∧ (vs[vhead4].next = null → vhead8 = vhead4), pc0 = E6 → owns(vhead3) = Some(tid1) ∧ (vhead4 ∈ orl ∨ vhead4 ∈ qrl) ∧ (ps[vhead4].next = null → vhead4 = vhead8), pc0 = E5 → owns(vhead3) = Some(tid1), pc0 = E3 → owns(vhead3) = Some(tid1), pc0 = E2 → owns(vhead3) = Some(tid1), pc0 = D34 → optval1 = vrvHp[vretRefs(tid1)] ∧ vrvHp[vretRefs(tid1)] = prvHp[pretRefs(tid1)] ∧ vretRefs(tid1) = pretRefs(tid1) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = (vrvHp[vretRefs(tid1)] = Empty ⊃ Pending(tid1);Claimed(tid1, vrvHp[vretRefs(tid1)].val)), pc0 = D24 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0], pc0 = D23 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next ∧ optval1 = vrvHp[rvref0], pc0 = D22 → ps[ps[vhead6].next].deqID ≠ None ∧ vhead6 ∈ orl ∧ ps[vhead6].next ≠ null ∧ vhead5 = ps[vhead6].next, pc0 = D21 → ps[vhead6].next ≠ null ∧ vhead6 ∈ orl ∧ vhead5 = ps[vhead6].next ∧ vs[ps[vhead6].next].deqID = Some(tid1) ∧ (ps[ps[vhead6].next].deqID = None → vhead7 = vhead6) ∧ noid(tid1, orl + qrl, ps[vhead6].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid1) → vhead7 = vhead6), pc0 = D6 → (obsEmpty0 → optval1 = vrvHp[rvref0] ∧ vrvHp[rvref0] = prvHp[rvref0]) ∧ Claimed(tid0, vs[ps[vhead2].next].val) = (optval1 = Empty ∨ ¬ obsEmpty0 ⊃ Pending(tid1);Claimed(tid1, optval1.val)), pc0 = D3 → rvowns(rvref0) = Pending(tid1) ∧ rvref0 ∈ vrvHp ∧ rvref0 ∈ prvHp ∧ rvref0 ≠ null, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → vrvHp[vretRefs(tid1)] = optval1, pc0 = E4 → (obsEmpty0 ⊃ noowns(tid1, owns);oneowns(tid1, vhead3, owns, vs, ps)), pc0 = E11 → (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid1, vhead3, owns, vs, ps);noowns(tid1, owns)), pc0 = E10 → (obsEmpty0 ⊃ (ps[vhead4].next ≠ vs[vhead4].next ⊃ oneweakowns(tid1, vhead3, owns, vs, ps);noowns(tid1, owns));oneowns(tid1, vhead3, owns, vs, ps)), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → oneowns(tid1, vhead3, owns, vs, ps), pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → noid(tid1, orl + qrl, vhead5, vs), pc0 = D20 ∨ pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → vhead7 ≠ vhead6 → nextnottid(tid1, vhead7, vs), pc0 = D21 ∨ pc0 = D22 ∨ pc0 = D23 ∨ pc0 = D24 → obsEmpty0 ∧ Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, vs[vhead5].val) ∧ optval1 = Val(vs[vhead5].val), pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → ¬ obsEmpty0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D34; (s) ⊦ D24 ≠ D34; (s) ⊦ D23 ≠ D34; (s) ⊦ D22 ≠ D34; (s) ⊦ D21 ≠ D34; (s) ⊦ D6 ≠ D34; (s) ⊦ D3 ≠ D34; (s) ⊦ D2 ≠ D34; (s) ⊦ D1 ≠ D34; (s) ⊦ D34 ≠ ready; (s) ⊦ D34 ≠ idle; (s) ⊦ D34 ≠ crashed; (s) ⊦ D34 ≠ E17; (s) ⊦ D34 ≠ E16; (s) ⊦ D34 ≠ E15; (s) ⊦ D34 ≠ E14; (s) ⊦ D34 ≠ E13; (s) ⊦ D34 ≠ E12; (s) ⊦ D34 ≠ E11; (s) ⊦ D34 ≠ E10; (s) ⊦ D34 ≠ E9; (s) ⊦ D34 ≠ E8; (s) ⊦ D34 ≠ E7; (s) ⊦ D34 ≠ E6; (s) ⊦ D34 ≠ E5; (s) ⊦ D34 ≠ E4; (s) ⊦ D34 ≠ E3; (s) ⊦ D34 ≠ E2; (s) ⊦ D34 ≠ E1; (s) ⊦ D15 ≠ D34; (s) ⊦ D14 ≠ D34; (s) ⊦ D13 ≠ D34; (s) ⊦ D33 ≠ D34; (s) ⊦ D32 ≠ D34; (s) ⊦ D31 ≠ D34; (s) ⊦ D30 ≠ D34; (s) ⊦ D29 ≠ D34; (s) ⊦ D28 ≠ D34; (s) ⊦ D27 ≠ D34; (s) ⊦ D26 ≠ D34; (s) ⊦ D25 ≠ D34; (s) ⊦ D19 ≠ D34; (s) ⊦ D18 ≠ D34; (s) ⊦ D17 ≠ D34; (s) ⊦ D16 ≠ D34; (s) ⊦ D12 ≠ D34; (s) ⊦ D11 ≠ D34; (s) ⊦ D10 ≠ D34; (s) ⊦ D9 ≠ D34; (s) ⊦ D8 ≠ D34; (s) ⊦ D7 ≠ D34; (s) ⊦ D5 ≠ D34; (s) ⊦ D4 ≠ D34; (s)

Proof step 337 from proof fwsim-tau-othertid (previous step) (back to tree)

Claimed(tid0, vs[ps[vhead2].next].val) = (prvHp[pretRefs(tid1)] = Empty ⊃ Pending(tid1);Claimed(tid1, prvHp[pretRefs(tid1)].val)), vrvHp[pretRefs(tid1)] = prvHp[pretRefs(tid1)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(pretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), vretRefs(tid1) = pretRefs(tid1), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, prvHp[pretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], pretRefs(tid1) ≠ null, tid ≠ tid1, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid1, owns), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, pretRefs(tid1) ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ Pending(tid) ≠ Claimed(tid0, val); (s)

Proof step 338 from proof fwsim-tau-othertid (previous step) (back to tree)

Claimed(tid0, vs[ps[vhead2].next].val) = Claimed(tid1, prvHp[pretRefs(tid1)].val), vrvHp[pretRefs(tid1)] = prvHp[pretRefs(tid1)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(pretRefs(tid1)) = Claimed(tid0, vs[ps[vhead2].next].val), vretRefs(tid1) = pretRefs(tid1), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, prvHp[pretRefs(tid1)] ≠ Empty, prvHp[pretRefs(tid1)] ≠ Val(vs[ps[vhead2].next].val), orl ≠ [], pretRefs(tid1) ≠ null, tid ≠ tid1, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), noowns(tid1, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, pretRefs(tid1) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Claimed(tid, val) = Claimed(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws)

Proof step 339 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead2].next].val = prvHp[pretRefs(tid1)].val, vrvHp[pretRefs(tid1)] = prvHp[pretRefs(tid1)], dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(pretRefs(tid1)) = Claimed(tid1, prvHp[pretRefs(tid1)].val), vretRefs(tid1) = pretRefs(tid1), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, prvHp[pretRefs(tid1)] ≠ Val(prvHp[pretRefs(tid1)].val), prvHp[pretRefs(tid1)] ≠ Empty, orl ≠ [], pretRefs(tid1) ≠ null, tid ≠ tid1, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), noid(tid1, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), noowns(tid1, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, pretRefs(tid1) ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: optelem, name:elim-Val, seq: ⊦ optval ≠ Empty → (val = optval.val ↔ optval = Val(val)), subst:[optval, val] → [prvHp[pretRefs(tid1)], val]

Additional information

Used simplifier rules: ⊦ optval ≠ Empty → (val = optval.val ↔ optval = Val(val)); (elim) Used terms: prvHp[pretRefs(tid1)], val

Proof step 340 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D30, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) 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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp:= vrvHp2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp2, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .addr = rvref0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ gstepf(gs, ls, D30, τ) = gs.prvHp:= gs.prvHp[ls.addr, gs.vrvHp[ls.addr]]; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D26 ≠ D30; (s) ⊦ D25 ≠ D30; (s) ⊦ D29 ≠ D30; (s) ⊦ D28 ≠ D30; (s) ⊦ D27 ≠ D30; (s) ⊦ D24 ≠ D30; (s) ⊦ D23 ≠ D30; (s) ⊦ D22 ≠ D30; (s) ⊦ D21 ≠ D30; (s) ⊦ D20 ≠ D30; (s) ⊦ D19 ≠ D30; (s) ⊦ D18 ≠ D30; (s) ⊦ D17 ≠ D30; (s) ⊦ D16 ≠ D30; (s) ⊦ D15 ≠ D30; (s) ⊦ D13 ≠ D30; (s) ⊦ D12 ≠ D30; (s) ⊦ D11 ≠ D30; (s) ⊦ D10 ≠ D30; (s) ⊦ D9 ≠ D30; (s) ⊦ D8 ≠ D30; (s) ⊦ D7 ≠ D30; (s) ⊦ D6 ≠ D30; (s) ⊦ D5 ≠ D30; (s) ⊦ D4 ≠ D30; (s) ⊦ D3 ≠ D30; (s) ⊦ D2 ≠ D30; (s) ⊦ D1 ≠ D30; (s) ⊦ D30 ≠ ready; (s) ⊦ D30 ≠ idle; (s) ⊦ D30 ≠ crashed; (s) ⊦ D30 ≠ E17; (s) ⊦ D30 ≠ E16; (s) ⊦ D30 ≠ E15; (s) ⊦ D30 ≠ E14; (s) ⊦ D30 ≠ E13; (s) ⊦ D30 ≠ E12; (s) ⊦ D30 ≠ E11; (s) ⊦ D30 ≠ E10; (s) ⊦ D30 ≠ E9; (s) ⊦ D30 ≠ E8; (s) ⊦ D30 ≠ E7; (s) ⊦ D30 ≠ E6; (s) ⊦ D30 ≠ E5; (s) ⊦ D30 ≠ E4; (s) ⊦ D30 ≠ E3; (s) ⊦ D30 ≠ E2; (s) ⊦ D30 ≠ E1; (s) ⊦ D30 ≠ D31; (s) ⊦ pre(gs, ls, D30, a) ↔ a = τ; (s) ⊦ D30 ≠ D34; (s) ⊦ D14 ≠ D30; (s)

Proof step 341 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, addr ∈ vrvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[addr, vrvHp[addr]], qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 342 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 343 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[addr, vrvHp[addr]], qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 344 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(addr) = Claimed(tid0, vs[ps[vhead2].next].val), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, addr ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, addr ∈ vrvHp, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[addr, vrvHp[addr]], qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[addr, vrvHp[addr]], qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp[addr, vrvHp[addr]], qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 345 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 346 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = D31, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead:= phead3 = mkgs (ps, ps0, phead, phead3, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ gstepf(gs, ls, D31, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ D26 ≠ D31; (s) ⊦ D25 ≠ D31; (s) ⊦ D30 ≠ D31; (s) ⊦ D29 ≠ D31; (s) ⊦ D28 ≠ D31; (s) ⊦ D27 ≠ D31; (s) ⊦ D24 ≠ D31; (s) ⊦ D23 ≠ D31; (s) ⊦ D22 ≠ D31; (s) ⊦ D21 ≠ D31; (s) ⊦ D20 ≠ D31; (s) ⊦ D19 ≠ D31; (s) ⊦ D18 ≠ D31; (s) ⊦ D17 ≠ D31; (s) ⊦ D16 ≠ D31; (s) ⊦ D15 ≠ D31; (s) ⊦ D13 ≠ D31; (s) ⊦ D12 ≠ D31; (s) ⊦ D11 ≠ D31; (s) ⊦ D10 ≠ D31; (s) ⊦ D9 ≠ D31; (s) ⊦ D8 ≠ D31; (s) ⊦ D7 ≠ D31; (s) ⊦ D6 ≠ D31; (s) ⊦ D5 ≠ D31; (s) ⊦ D4 ≠ D31; (s) ⊦ D3 ≠ D31; (s) ⊦ D2 ≠ D31; (s) ⊦ D1 ≠ D31; (s) ⊦ D31 ≠ ready; (s) ⊦ D31 ≠ idle; (s) ⊦ D31 ≠ crashed; (s) ⊦ D31 ≠ E17; (s) ⊦ D31 ≠ E16; (s) ⊦ D31 ≠ E15; (s) ⊦ D31 ≠ E14; (s) ⊦ D31 ≠ E13; (s) ⊦ D31 ≠ E12; (s) ⊦ D31 ≠ E11; (s) ⊦ D31 ≠ E10; (s) ⊦ D31 ≠ E9; (s) ⊦ D31 ≠ E8; (s) ⊦ D31 ≠ E7; (s) ⊦ D31 ≠ E6; (s) ⊦ D31 ≠ E5; (s) ⊦ D31 ≠ E4; (s) ⊦ D31 ≠ E3; (s) ⊦ D31 ≠ E2; (s) ⊦ D31 ≠ E1; (s) ⊦ pre(gs, ls, D31, a) ↔ a = τ; (s) ⊦ D31 ≠ D34; (s) ⊦ D14 ≠ D31; (s)

Proof step 347 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 348 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 349 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = E10, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 350 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead, phead1, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 351 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 352 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 353 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = E11, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 354 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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, vhead, phead1, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 355 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(vhead4 = phead1 ∧ ps0[phead1].next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 356 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (pc0 = D20 ⊃ obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 357 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = D20, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 358 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( obsEmpty0 → (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead, phead1, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 359 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(obsEmpty0 → ps0[vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 360 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc0 = D21, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 361 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬ ( (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead, phead1, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 362 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, ¬(ps0[vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 363 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 364 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 365 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid1, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 366 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [(vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 367 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 368 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

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) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s)

Proof step 369 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ als.tid, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (als.tid) ]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 370 from proof fwsim-tau-othertid (previous step) (back to tree)

als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 371 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead2 ∈ ps, vhead2 ∈ vs, vretRefs(tid) ∈ vrvHp, vhead2 ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]) ⊦

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, vhead, phead1, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead7 = vhead2 ⊃ mkgs (ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 372 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead7 = vhead2 ⊃ mkgs(ps, vs, phead, ps[vhead2].next, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), ps[ps[vhead2].next].deqID ≠ None, ps[vhead2].next ≠ null, orl ≠ [], tid ≠ tid0, vretRefs(tid) ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead2 ∈ orl, vretRefs(tid) ∈ vrvHp, vhead2 ∈ vs, vhead2 ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 373 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = E2, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ ⊦ 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) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ gstepf(gs, ls, E2, τ) = gs.vs:= gs.vs[ls.node, mk(ls.value, None, null)]; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D26 ≠ E2; (s) ⊦ D25 ≠ E2; (s) ⊦ E2 ≠ E17; (s) ⊦ E2 ≠ E12; (s) ⊦ E1 ≠ E2; (s) ⊦ D33 ≠ E2; (s) ⊦ D32 ≠ E2; (s) ⊦ D31 ≠ E2; (s) ⊦ D30 ≠ E2; (s) ⊦ D29 ≠ E2; (s) ⊦ D28 ≠ E2; (s) ⊦ D27 ≠ E2; (s) ⊦ D24 ≠ E2; (s) ⊦ D23 ≠ E2; (s) ⊦ D22 ≠ E2; (s) ⊦ D21 ≠ E2; (s) ⊦ D20 ≠ E2; (s) ⊦ D19 ≠ E2; (s) ⊦ D18 ≠ E2; (s) ⊦ D17 ≠ E2; (s) ⊦ D16 ≠ E2; (s) ⊦ D15 ≠ E2; (s) ⊦ D13 ≠ E2; (s) ⊦ D12 ≠ E2; (s) ⊦ D11 ≠ E2; (s) ⊦ D10 ≠ E2; (s) ⊦ D9 ≠ E2; (s) ⊦ D8 ≠ E2; (s) ⊦ D7 ≠ E2; (s) ⊦ D6 ≠ E2; (s) ⊦ D5 ≠ E2; (s) ⊦ D4 ≠ E2; (s) ⊦ D3 ≠ E2; (s) ⊦ D2 ≠ E2; (s) ⊦ D1 ≠ E2; (s) ⊦ E2 ≠ ready; (s) ⊦ E2 ≠ idle; (s) ⊦ E2 ≠ crashed; (s) ⊦ E2 ≠ E4; (s) ⊦ E2 ≠ E11; (s) ⊦ E2 ≠ E10; (s) ⊦ E2 ≠ E16; (s) ⊦ E2 ≠ E15; (s) ⊦ E2 ≠ E14; (s) ⊦ E2 ≠ E13; (s) ⊦ E2 ≠ E9; (s) ⊦ E2 ≠ E8; (s) ⊦ E2 ≠ E7; (s) ⊦ E2 ≠ E6; (s) ⊦ E2 ≠ E5; (s) ⊦ E2 ≠ E3; (s) ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ D34 ≠ E2; (s) ⊦ D14 ≠ E2; (s)

Proof step 374 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps, vs[vhead, mk(val, None, null)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 375 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 376 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ absls (mkgs(ps, vs[vhead, mk(val, None, null)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 377 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ absls (mkgs(ps, vs[vhead, mk(val, None, null)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs[vhead, mk(val, None, null)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) Used terms: mkgs (ps, vs[vhead, mk(val, None, null)], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 378 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 379 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = E3, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps:= ps1 = mkgs (ps1, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ gstepf(gs, ls, E3, τ) = gs.ps:= gs.ps[ls.node, gs.vs[ls.node]]; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D26 ≠ E3; (s) ⊦ D25 ≠ E3; (s) ⊦ E3 ≠ E17; (s) ⊦ E3 ≠ E12; (s) ⊦ E1 ≠ E3; (s) ⊦ D33 ≠ E3; (s) ⊦ D32 ≠ E3; (s) ⊦ D31 ≠ E3; (s) ⊦ D30 ≠ E3; (s) ⊦ D29 ≠ E3; (s) ⊦ D28 ≠ E3; (s) ⊦ D27 ≠ E3; (s) ⊦ D24 ≠ E3; (s) ⊦ D23 ≠ E3; (s) ⊦ D22 ≠ E3; (s) ⊦ D21 ≠ E3; (s) ⊦ D20 ≠ E3; (s) ⊦ D19 ≠ E3; (s) ⊦ D18 ≠ E3; (s) ⊦ D17 ≠ E3; (s) ⊦ D16 ≠ E3; (s) ⊦ D15 ≠ E3; (s) ⊦ D13 ≠ E3; (s) ⊦ D12 ≠ E3; (s) ⊦ D11 ≠ E3; (s) ⊦ D10 ≠ E3; (s) ⊦ D9 ≠ E3; (s) ⊦ D8 ≠ E3; (s) ⊦ D7 ≠ E3; (s) ⊦ D6 ≠ E3; (s) ⊦ D5 ≠ E3; (s) ⊦ D4 ≠ E3; (s) ⊦ D3 ≠ E3; (s) ⊦ D2 ≠ E3; (s) ⊦ D1 ≠ E3; (s) ⊦ E3 ≠ ready; (s) ⊦ E3 ≠ idle; (s) ⊦ E3 ≠ crashed; (s) ⊦ E2 ≠ E3; (s) ⊦ E3 ≠ E4; (s) ⊦ E3 ≠ E11; (s) ⊦ E3 ≠ E10; (s) ⊦ E3 ≠ E16; (s) ⊦ E3 ≠ E15; (s) ⊦ E3 ≠ E14; (s) ⊦ E3 ≠ E13; (s) ⊦ E3 ≠ E9; (s) ⊦ E3 ≠ E8; (s) ⊦ E3 ≠ E7; (s) ⊦ E3 ≠ E6; (s) ⊦ E3 ≠ E5; (s) ⊦ pre(gs, ls, E3, a) ↔ a = τ; (s) ⊦ D34 ≠ E3; (s) ⊦ D14 ≠ E3; (s)

Proof step 380 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead, mk(val, None, null)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 381 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead, mk(val, None, null)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 382 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E10, ¬(obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 383 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [ps, vhead, mk(val, None, null), vhead8], <all paths>

Additional information

Used terms: ps, vhead, mk(val, None, null), vhead8

Proof step 384 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 385 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vhead8 = vhead, ¬(obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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) ⊦ a = b → st[b, d][a] = d; (s)

Proof step 386 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: mkgs (ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 387 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 388 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead, mk(val, None, null)][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 389 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E11, vhead4 = vhead8, ¬(ps[vhead, mk(val, None, null)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 390 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(ps[vhead, mk(val, None, null)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, vhead, mk(val, None, null), vhead8], <all paths>

Additional information

Used terms: ps, vhead, mk(val, None, null), vhead8

Proof step 391 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 392 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vhead8 = vhead, ¬(ps[vhead, mk(val, None, null)][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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) ⊦ a = b → st[b, d][a] = d; (s)

Proof step 393 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ D3 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D5 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: mkgs (ps, vs, phead, vhead7, vhead, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 394 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 395 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (pc0 = D20 ⊃ obsEmpty0 → ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 396 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D20, ¬(obsEmpty0 → ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 397 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(obsEmpty0 → ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [ps, vhead, mk(val, None, null), vhead5], <all paths>

Additional information

Used terms: ps, vhead, mk(val, None, null), vhead5

Proof step 398 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 399 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vhead5 = vhead, ¬(obsEmpty0 → ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s)

Proof step 400 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead].deqID ≠ None, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D20], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ D20 ≠ crashed; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ ready; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ E17; (s) ⊦ D1 ≠ D20; (s) ⊦ D2 ≠ D20; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D7 ≠ D20; (s) ⊦ D20 ≠ D32; (s) ⊦ D20 ≠ D33; (s) ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ D34; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D27; (s) ⊦ D20 ≠ D26; (s) ⊦ D20 ≠ D25; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D21; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ Val(val).val = val; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ D19 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D3 ≠ D20; (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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D20

Proof step 401 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 402 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D21, ¬(ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 403 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [ps, vhead, mk(val, None, null), vhead5], <all paths>

Additional information

Used terms: ps, vhead, mk(val, None, null), vhead5

Proof step 404 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 405 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vhead5 = vhead, ¬(ps[vhead, mk(val, None, null)][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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).deqID = opttid; (s) ⊦ a = b → st[b, d][a] = d; (s)

Proof step 406 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead].deqID ≠ None, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D21], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ D21 ≠ crashed; (s) ⊦ D21 ≠ idle; (s) ⊦ D21 ≠ ready; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ E17; (s) ⊦ D1 ≠ D21; (s) ⊦ D2 ≠ D21; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ Val(val).val = val; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ D7 ≠ D21; (s) ⊦ D21 ≠ D32; (s) ⊦ D21 ≠ D33; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E12; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ D34; (s) ⊦ D21 ≠ D31; (s) ⊦ D21 ≠ D30; (s) ⊦ D21 ≠ D29; (s) ⊦ D21 ≠ D28; (s) ⊦ D21 ≠ D27; (s) ⊦ D21 ≠ D26; (s) ⊦ D21 ≠ D25; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D21 ≠ D22; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D20 ≠ D21; (s) ⊦ D19 ≠ D21; (s) ⊦ D18 ≠ D21; (s) ⊦ D17 ≠ D21; (s) ⊦ D16 ≠ D21; (s) ⊦ D15 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D9 ≠ D21; (s) ⊦ D8 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D5 ≠ D21; (s) ⊦ D4 ≠ D21; (s) ⊦ D3 ≠ D21; (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: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead, rvref0, optval2, vhead6, tid2, addr0), D21

Proof step 407 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 408 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ absls (mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 409 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 410 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 411 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 412 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 413 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps[vhead, mk(val, None, null)], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 414 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val2, val1, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 415 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), als = mkls(tid0, obsEmpty, val1, optval, val2, optval0), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 416 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 37

Additional information

Proof step 417 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 418 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 49

Additional information

Proof step 419 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E10, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead, mk(val, None, null)][vhead8].next = null, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 420 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead, mk(val, None, null)][vhead8].next = null, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 421 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 422 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead, mk(val, None, null)][vhead8].next = null, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E10 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E10 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E10 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E10 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E10 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), E10 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E10 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, E10 = E4 ∨ E10 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D13 ∨ E10 = D14 ∨ E10 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 ∨ E10 = E1 ∨ E10 = E12 ∨ E10 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), E10 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), E10 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), E10 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E10 ≠ E11; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ ready; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ E17; (s) ⊦ D2 ≠ E10; (s) ⊦ D1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 423 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead8].next = vs[vhead8].next, ps[vhead, mk(val, None, null)][vhead8].next = null, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead8].next ≠ null, vs[vs[vhead8].next].val ≠ val1, orl ≠ [], tid ≠ tid0, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid0, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid0, orl + qrl, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid0, owns), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 ∈ orl ∨ vhead8 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, vhead, mk(val, None, null), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) Used terms: ps, vhead, mk(val, None, null), vhead8

Proof step 424 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 425 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead, mk(val, None, null)][vhead8].next = null, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E11, vhead4 = vhead8, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 426 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead, mk(val, None, null)][vhead8].next = null, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 427 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 428 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead, mk(val, None, null)][vhead8].next = null, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E11 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E11 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E11 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E11 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E11 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E11 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E11 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E11 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), E11 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E11 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E11 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E11 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), E11 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E11 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E11 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E11 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, E11 = E4 ∨ E11 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = D13 ∨ E11 = D14 ∨ E11 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = E1 ∨ E11 = E2 ∨ E11 = E3 ∨ E11 = E4 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E10 ∨ E11 = E11 ∨ E11 = E12 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 ∨ E11 = E17 ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D18 ∨ E11 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = D22 ∨ E11 = D23 ∨ E11 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), E11 = crashed ∨ E11 = idle ∨ E11 = ready ∨ E11 = D1 ∨ E11 = D2 ∨ E11 = D3 ∨ E11 = D4 ∨ E11 = D5 ∨ E11 = D6 ∨ E11 = D7 ∨ E11 = D8 ∨ E11 = D9 ∨ E11 = D10 ∨ E11 = D11 ∨ E11 = D12 ∨ E11 = D13 ∨ E11 = D14 ∨ E11 = D15 ∨ E11 = D16 ∨ E11 = D17 ∨ E11 = D18 ∨ E11 = D19 ∨ E11 = D20 ∨ E11 = D21 ∨ E11 = D22 ∨ E11 = D23 ∨ E11 = D24 ∨ E11 = D25 ∨ E11 = D26 ∨ E11 = D27 ∨ E11 = D28 ∨ E11 = D29 ∨ E11 = D30 ∨ E11 = D31 ∨ E11 = D32 ∨ E11 = D33 ∨ E11 = D34 ∨ E11 = E1 ∨ E11 = E12 ∨ E11 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), E11 = E2 ∨ E11 = E3 ∨ E11 = E5 ∨ E11 = E6 ∨ E11 = E7 ∨ E11 = E8 ∨ E11 = E9 ∨ E11 = E13 ∨ E11 = E14 ∨ E11 = E15 ∨ E11 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), E11 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), E11 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), E11 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead8, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E11 ≠ E12; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E16; (s) ⊦ E4 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ E1 ≠ E11; (s) ⊦ E11 ≠ ready; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ E17; (s) ⊦ D2 ≠ E11; (s) ⊦ D1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 429 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead8].next = vs[vhead8].next, ps[vhead, mk(val, None, null)][vhead8].next = null, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead8].next ≠ null, vs[vs[vhead8].next].val ≠ val1, orl ≠ [], tid ≠ tid0, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid0, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid0, orl + qrl, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid0, owns), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 ∈ orl ∨ vhead8 ∈ qrl, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [ps, vhead, mk(val, None, null), vhead8], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).next = nxt; (s) Used terms: ps, vhead, mk(val, None, null), vhead8

Proof step 430 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 431 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D22, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 432 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None ⊦ pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None, pc0 = D21 ∧ ps[vhead5].deqID ≠ None

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 38

Additional information

Proof step 433 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, obsEmpty0, owns(vhead) = Some(tid), pc0 = D20, ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ D34; (s) ⊦ D6 ≠ D20; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D15 ≠ D20; (s) ⊦ D20 ≠ D22; (s)

Proof step 434 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20

Proof step 435 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 436 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), D20 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D20 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D20 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D20 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D20 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), D20 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D20 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D20 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, D20 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), D20 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), D20 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D20 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D20 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D20 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D20 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D20 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D20 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), D20 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D20 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D20 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D20 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, D20 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, D20 = E4 ∨ D20 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = D13 ∨ D20 = D14 ∨ D20 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D20 = idle ∨ D20 = ready ∨ D20 = E1 ∨ D20 = E2 ∨ D20 = E3 ∨ D20 = E4 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E10 ∨ D20 = E11 ∨ D20 = E12 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 ∨ D20 = E17 ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = crashed ∨ D20 = idle ∨ D20 = ready ∨ D20 = E1 ∨ D20 = E2 ∨ D20 = E3 ∨ D20 = E4 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E10 ∨ D20 = E11 ∨ D20 = E12 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 ∨ D20 = E17 ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D18 ∨ D20 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = D22 ∨ D20 = D23 ∨ D20 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D20 = crashed ∨ D20 = idle ∨ D20 = ready ∨ D20 = D1 ∨ D20 = D2 ∨ D20 = D3 ∨ D20 = D4 ∨ D20 = D5 ∨ D20 = D6 ∨ D20 = D7 ∨ D20 = D8 ∨ D20 = D9 ∨ D20 = D10 ∨ D20 = D11 ∨ D20 = D12 ∨ D20 = D13 ∨ D20 = D14 ∨ D20 = D15 ∨ D20 = D16 ∨ D20 = D17 ∨ D20 = D18 ∨ D20 = D19 ∨ D20 = D20 ∨ D20 = D21 ∨ D20 = D22 ∨ D20 = D23 ∨ D20 = D24 ∨ D20 = D25 ∨ D20 = D26 ∨ D20 = D27 ∨ D20 = D28 ∨ D20 = D29 ∨ D20 = D30 ∨ D20 = D31 ∨ D20 = D32 ∨ D20 = D33 ∨ D20 = D34 ∨ D20 = E1 ∨ D20 = E12 ∨ D20 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), D20 = E2 ∨ D20 = E3 ∨ D20 = E5 ∨ D20 = E6 ∨ D20 = E7 ∨ D20 = E8 ∨ D20 = E9 ∨ D20 = E13 ∨ D20 = E14 ∨ D20 = E15 ∨ D20 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), D20 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), D20 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), D20 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 ⊦ D3 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D14 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D19 ≠ D20; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ D20 ≠ D21; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D25; (s) ⊦ D20 ≠ D26; (s) ⊦ D20 ≠ D27; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ D34; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ D33; (s) ⊦ D20 ≠ D32; (s) ⊦ D7 ≠ D20; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ D2 ≠ D20; (s) ⊦ D1 ≠ D20; (s) ⊦ D20 ≠ E17; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ ready; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ crashed; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 437 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead6].next].deqID = Some(tid0), ps[ps[vhead6].next].deqID = None, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pretRefs(tid0) = vretRefs(tid0), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead6].next].val), ps[vhead, mk(val, None, null)][ps[vhead6].next].deqID ≠ None, ps[vhead6].next ≠ null, optval ≠ Val(vs[ps[vhead6].next].val), orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead6 ≠ vhead4, vretRefs(tid0) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead6, vs), noid(tid0, orl + qrl, ps[vhead6].next, vs), noid(tid, orl + qrl, vhead6, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid0, owns), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vhead6 ∈ ps, vhead6 ∈ vs, vhead6 ∈ orl from vhead6, vhead6 ∈ orl, vhead8 ∈ orl + qrl from vhead4, vretRefs(tid0) ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead6].next ≠ null ∧ vs[vs[vhead6].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead6].next].deqID.tid)) = Claimed(vs[vs[vhead6].next].deqID.tid, vs[vs[vhead6].next].val), vhead4 ∈ orl from vhead6 ∨ vhead4 ∈ qrl, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead6 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead6 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [ps, vhead, mk(val, None, null), ps[vhead6].next], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) Used terms: ps, vhead, mk(val, None, null), ps[vhead6].next

Proof step 438 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 439 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D21, ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ D34; (s) ⊦ D6 ≠ D21; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D15 ≠ D21; (s) ⊦ D21 ≠ D22; (s)

Proof step 440 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21

Proof step 441 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 442 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead, mk(val, None, null)][vhead5].deqID ≠ None, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), D21 = D3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D21 = D4 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D21 = D5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D21 = D8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D21 = D9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D21 = D10 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D21 = D11 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), D21 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), D21 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D21 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, D21 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, D21 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D21 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D21 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), D21 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), D21 = D22 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D21 = D23 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D21 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], D21 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D21 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D21 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val)), D21 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D21 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D21 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), D21 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, D21 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), D21 = E2 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E3 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E5 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E6 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), D21 = E7 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D21 = E8 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D21 = E9 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), D21 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D21 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), D21 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, D21 = E13 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E14 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = E15 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, D21 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E2 ∨ D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, D21 = E4 ∨ D21 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = D13 ∨ D21 = D14 ∨ D21 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), D21 = E2 ∨ D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), D21 = idle ∨ D21 = ready ∨ D21 = E1 ∨ D21 = E2 ∨ D21 = E3 ∨ D21 = E4 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E10 ∨ D21 = E11 ∨ D21 = E12 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 ∨ D21 = E17 ∨ D21 = D1 ∨ D21 = D2 ∨ D21 = D3 ∨ D21 = D4 ∨ D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 ∨ D21 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 → mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = crashed ∨ D21 = idle ∨ D21 = ready ∨ D21 = E1 ∨ D21 = E2 ∨ D21 = E3 ∨ D21 = E4 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E10 ∨ D21 = E11 ∨ D21 = E12 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 ∨ D21 = E17 ∨ D21 = D1 ∨ D21 = D2 ∨ D21 = D3 ∨ D21 = D4 ∨ D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 ∨ D21 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D18 ∨ D21 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = D22 ∨ D21 = D23 ∨ D21 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D21 = crashed ∨ D21 = idle ∨ D21 = ready ∨ D21 = D1 ∨ D21 = D2 ∨ D21 = D3 ∨ D21 = D4 ∨ D21 = D5 ∨ D21 = D6 ∨ D21 = D7 ∨ D21 = D8 ∨ D21 = D9 ∨ D21 = D10 ∨ D21 = D11 ∨ D21 = D12 ∨ D21 = D13 ∨ D21 = D14 ∨ D21 = D15 ∨ D21 = D16 ∨ D21 = D17 ∨ D21 = D18 ∨ D21 = D19 ∨ D21 = D20 ∨ D21 = D21 ∨ D21 = D22 ∨ D21 = D23 ∨ D21 = D24 ∨ D21 = D25 ∨ D21 = D26 ∨ D21 = D27 ∨ D21 = D28 ∨ D21 = D29 ∨ D21 = D30 ∨ D21 = D31 ∨ D21 = D32 ∨ D21 = D33 ∨ D21 = D34 ∨ D21 = E1 ∨ D21 = E12 ∨ D21 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), D21 = E2 ∨ D21 = E3 ∨ D21 = E5 ∨ D21 = E6 ∨ D21 = E7 ∨ D21 = E8 ∨ D21 = E9 ∨ D21 = E13 ∨ D21 = E14 ∨ D21 = E15 ∨ D21 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), D21 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), D21 = E11 → ( mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), D21 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 ⊦ D3 ≠ D21; (s) ⊦ D4 ≠ D21; (s) ⊦ D5 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D8 ≠ D21; (s) ⊦ D9 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D15 ≠ D21; (s) ⊦ D16 ≠ D21; (s) ⊦ D17 ≠ D21; (s) ⊦ D18 ≠ D21; (s) ⊦ D19 ≠ D21; (s) ⊦ D20 ≠ D21; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .first = node2; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ D21 ≠ D22; (s) ⊦ D21 ≠ D23; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D25; (s) ⊦ D21 ≠ D26; (s) ⊦ D21 ≠ D27; (s) ⊦ D21 ≠ D28; (s) ⊦ D21 ≠ D29; (s) ⊦ D21 ≠ D30; (s) ⊦ D21 ≠ D31; (s) ⊦ D21 ≠ D34; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E12; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ D33; (s) ⊦ D21 ≠ D32; (s) ⊦ D7 ≠ D21; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ Val(val).val = val; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ D2 ≠ D21; (s) ⊦ D1 ≠ D21; (s) ⊦ D21 ≠ E17; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ ready; (s) ⊦ D21 ≠ idle; (s) ⊦ D21 ≠ crashed; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 443 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[ps[vhead6].next].deqID = Some(tid0), ps[ps[vhead6].next].deqID = None, vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pretRefs(tid0) = vretRefs(tid0), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead6].next].val), ps[vhead, mk(val, None, null)][ps[vhead6].next].deqID ≠ None, ps[vhead6].next ≠ null, optval ≠ Val(vs[ps[vhead6].next].val), orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead6 ≠ vhead4, vretRefs(tid0) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead6, vs), noid(tid0, orl + qrl, ps[vhead6].next, vs), noid(tid, orl + qrl, vhead6, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid0, owns), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vhead6 ∈ ps, vhead6 ∈ vs, vhead6 ∈ orl, vhead8 ∈ orl + qrl from vhead4, vretRefs(tid0) ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead6].next ≠ null ∧ vs[vs[vhead6].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead6].next].deqID.tid)) = Claimed(vs[vs[vhead6].next].deqID.tid, vs[vs[vhead6].next].val), vhead4 ∈ orl from vhead6 ∨ vhead4 ∈ qrl, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead6 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead6 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

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] → [ps, vhead, mk(val, None, null), ps[vhead6].next], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) Used terms: ps, vhead, mk(val, None, null), ps[vhead6].next

Proof step 444 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 445 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = E9, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (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) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (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) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ 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) ⊦ D26 ≠ E9; (s) ⊦ D25 ≠ E9; (s) ⊦ E9 ≠ E17; (s) ⊦ E9 ≠ E12; (s) ⊦ E1 ≠ E9; (s) ⊦ D33 ≠ E9; (s) ⊦ D32 ≠ E9; (s) ⊦ D31 ≠ E9; (s) ⊦ D30 ≠ E9; (s) ⊦ D29 ≠ E9; (s) ⊦ D28 ≠ E9; (s) ⊦ D27 ≠ E9; (s) ⊦ D24 ≠ E9; (s) ⊦ D23 ≠ E9; (s) ⊦ D22 ≠ E9; (s) ⊦ D21 ≠ E9; (s) ⊦ D20 ≠ E9; (s) ⊦ D19 ≠ E9; (s) ⊦ D18 ≠ E9; (s) ⊦ D17 ≠ E9; (s) ⊦ D16 ≠ E9; (s) ⊦ D15 ≠ E9; (s) ⊦ D13 ≠ E9; (s) ⊦ D12 ≠ E9; (s) ⊦ D11 ≠ E9; (s) ⊦ D10 ≠ E9; (s) ⊦ D9 ≠ E9; (s) ⊦ D8 ≠ E9; (s) ⊦ D7 ≠ E9; (s) ⊦ D6 ≠ E9; (s) ⊦ D5 ≠ E9; (s) ⊦ D4 ≠ E9; (s) ⊦ D3 ≠ E9; (s) ⊦ D2 ≠ E9; (s) ⊦ D1 ≠ E9; (s) ⊦ E9 ≠ ready; (s) ⊦ E9 ≠ idle; (s) ⊦ E9 ≠ crashed; (s) ⊦ E8 ≠ E9; (s) ⊦ E7 ≠ E9; (s) ⊦ E6 ≠ E9; (s) ⊦ E5 ≠ E9; (s) ⊦ E4 ≠ E9; (s) ⊦ E3 ≠ E9; (s) ⊦ E2 ≠ E9; (s) ⊦ E9 ≠ E11; (s) ⊦ E9 ≠ E10; (s) ⊦ E9 ≠ E16; (s) ⊦ E9 ≠ E15; (s) ⊦ E9 ≠ E14; (s) ⊦ E9 ≠ E13; (s) ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ D34 ≠ E9; (s) ⊦ D14 ≠ E9; (s)

Proof step 446 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 447 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 448 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E10, ¬ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 449 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead1, phead1, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 450 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 451 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 452 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E11, ¬ ( vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 453 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬ ( vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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, vhead1, phead1, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 454 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(vhead4 = phead1 ∧ ps0[phead1].next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 455 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 456 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D20, ¬ ( obsEmpty0 → ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 457 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬ ( obsEmpty0 → ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead1, phead1, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 458 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(obsEmpty0 → ps0[vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 459 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D21, ¬ ( ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 460 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬ ( ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead1, phead1, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 461 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ¬(ps0[vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 462 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ absls (((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 463 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 464 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 465 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 466 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 467 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

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) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s)

Proof step 468 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (als.tid) ]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val2, val1, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 469 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), als = mkls(tid0, obsEmpty, val1, optval, val2, optval0), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 470 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead0].next = null → vhead8 = vhead0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]) ⊦

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, vhead1, phead1, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, ((ps ⊕ vs)[vhead0].next = null ⊃ mkgs (ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 471 from proof fwsim-tau-othertid (previous step) (back to tree)

((ps ⊕ vs)[vhead0].next = null ⊃ mkgs(ps, vs[vhead0, vs[vhead0].next:= vhead], phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(vhead; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next = null → vhead8 = vhead0, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ 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)

Proof step 472 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = E11, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 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) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl:= qrl1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl1, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps:= ps1 = mkgs (ps1, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ gstepf(gs, ls, E11, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.qrl ;gs.qrl + gs.vs[ls.lst].next )) .owns:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.owns ;gs.owns(ls.node; None) ); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ E12; (s) ⊦ E1 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ D1 ≠ E11; (s) ⊦ E11 ≠ ready; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ crashed; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ doEnq(tid) ≠ τ; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s) ⊦ D34 ≠ E11; (s) ⊦ D14 ≠ E11; (s)

Proof step 473 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: heap-updnxt-id: ⊦ ps[r].next = vs[r].next ∧ r ∈ ps → ps[r, ps[r].next:= vs[r].next] = ps; 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] ⊦ owns(r) = Weak(tid) → ¬ noowns(tid, owns); (s)

Proof step 474 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: heap-updnxt-id: ⊦ ps[r].next = vs[r].next ∧ r ∈ ps → ps[r, ps[r].next:= vs[r].next] = ps; ⊦ E4 ≠ E10; (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] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ owns(r) = Weak(tid) → ¬ noowns(tid, owns); (s)

Proof step 475 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: heap-updnxt-id: ⊦ ps[r].next = vs[r].next ∧ r ∈ ps → ps[r, ps[r].next:= vs[r].next] = ps; ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (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] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ owns(r) = Weak(tid) → ¬ noowns(tid, owns); (s)

Proof step 476 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And closed the goal!

Rule argument

pos: right 1

Additional information

Used simplifier rules: heap-updnxt-id: ⊦ ps[r].next = vs[r].next ∧ r ∈ ps → ps[r, ps[r].next:= vs[r].next] = ps; heap-updnxt-id: ⊦ ps[r].next = vs[r].next ∧ r ∈ ps → ps[r, ps[r].next:= vs[r].next] = ps; ⊦ D20 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E4; (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] ⊦ owns(r) = Weak(tid) → ¬ noowns(tid, owns); (s) ⊦ D6 ≠ D20; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E4; (s)

Proof step 477 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = E12, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail:= phead4 = mkgs (ps, ps0, phead, phead0, phead4, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ gstepf(gs, ls, E12, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.node;gs); (s) ⊦ D26 ≠ E12; (s) ⊦ D25 ≠ E12; (s) ⊦ E1 ≠ E12; (s) ⊦ D33 ≠ E12; (s) ⊦ D32 ≠ E12; (s) ⊦ D31 ≠ E12; (s) ⊦ D30 ≠ E12; (s) ⊦ D29 ≠ E12; (s) ⊦ D28 ≠ E12; (s) ⊦ D27 ≠ E12; (s) ⊦ D24 ≠ E12; (s) ⊦ D23 ≠ E12; (s) ⊦ D22 ≠ E12; (s) ⊦ D21 ≠ E12; (s) ⊦ D20 ≠ E12; (s) ⊦ D19 ≠ E12; (s) ⊦ D18 ≠ E12; (s) ⊦ D17 ≠ E12; (s) ⊦ D16 ≠ E12; (s) ⊦ D15 ≠ E12; (s) ⊦ D13 ≠ E12; (s) ⊦ D12 ≠ E12; (s) ⊦ D11 ≠ E12; (s) ⊦ D10 ≠ E12; (s) ⊦ D9 ≠ E12; (s) ⊦ D8 ≠ E12; (s) ⊦ D7 ≠ E12; (s) ⊦ D6 ≠ E12; (s) ⊦ D5 ≠ E12; (s) ⊦ D4 ≠ E12; (s) ⊦ D3 ≠ E12; (s) ⊦ D2 ≠ E12; (s) ⊦ D1 ≠ E12; (s) ⊦ E12 ≠ ready; (s) ⊦ E12 ≠ idle; (s) ⊦ E12 ≠ crashed; (s) ⊦ E11 ≠ E12; (s) ⊦ E10 ≠ E12; (s) ⊦ E9 ≠ E12; (s) ⊦ E8 ≠ E12; (s) ⊦ E7 ≠ E12; (s) ⊦ E6 ≠ E12; (s) ⊦ E5 ≠ E12; (s) ⊦ E4 ≠ E12; (s) ⊦ E3 ≠ E12; (s) ⊦ E2 ≠ E12; (s) ⊦ E12 ≠ E16; (s) ⊦ E12 ≠ E15; (s) ⊦ E12 ≠ E14; (s) ⊦ E12 ≠ E13; (s) ⊦ pre(gs, ls, E12, a) ↔ a = τ; (s) ⊦ D34 ≠ E12; (s) ⊦ D14 ≠ E12; (s)

Proof step 478 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 479 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 480 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pc0 = E10, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 481 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 482 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬(obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 483 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vhead8 = vhead0, vs[vhead0].next ≠ null, ¬(obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 484 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vs0[vhead0].next].next = null, ps0[vhead0].next = vs0[vhead0].next, dom vrvHp = dom prvHp, vs0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs0, ps0, owns), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, vs0[vhead0].next ∈ vs0, vs0[vhead0].next ∈ ps0, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vs0[vhead0].next ∈ orl ∨ vs0[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) Used terms: mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 485 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 486 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 487 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pc0 = E11, vs[vhead0].next ≠ null, ¬ ( vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 488 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬ ( vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 489 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬(vhead4 = phead1 ∧ ps0[phead1].next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 490 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vhead8 = vhead0, vs[vhead0].next ≠ null, ¬(vhead4 = phead1 ∧ ps0[phead1].next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = 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] 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) = 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)

Proof step 491 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vs0[vhead0].next].next = null, ps0[vhead0].next = vs0[vhead0].next, dom vrvHp = dom prvHp, vs0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ orl, vs0[vhead0].next ∈ ps0, vs0[vhead0].next ∈ vs0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs0[vhead0].next ∈ orl ∨ vs0[vhead0].next ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) Used terms: mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 492 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 493 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 494 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pc0 = D20, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 495 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 496 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬(obsEmpty0 → ps0[vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 497 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, pc0 = D21, vs[vhead0].next ≠ null, ¬ ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 498 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬ ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 499 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, ¬(ps0[vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 500 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 501 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 502 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 503 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [(vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 504 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 505 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

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) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s)

Proof step 506 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (als.tid) ]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 507 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, als = mkls(tid0, obsEmpty, val, optval, val1, optval0), dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 508 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]) ⊦

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, vhead, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 509 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), dom vrvHp = dom prvHp, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vs[vhead0].next ∈ ps, vs[vhead0].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 510 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0].next = vs[vhead0].next, dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, vs[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vhead8 = vhead0, vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[vhead0].next ∈ vs, vs[vhead0].next ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(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] 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) = 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)

Proof step 511 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, vs0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), listp(orl + qrl, vs0, ps0, owns), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), vs0[vhead0].next ∈ vs0, vs0[vhead0].next ∈ ps0, phead ∈ orl, phead ∈ vs0, phead ∈ ps0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vs0[vhead0].next ∈ orl ∨ vs0[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vs0[vhead0].next ∧ ps0[vs0[vhead0].next].next = null) ∨ pc0 = E11 ∧ vhead4 = vs0[vhead0].next ∧ ps0[vs0[vhead0].next].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ ¬ obsEmpty0

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 48

Additional information

Proof step 512 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, pc0 = E10, vs0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ orl, vs0[vhead0].next ∈ ps0, vs0[vhead0].next ∈ vs0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, obsEmpty0 → vhead4 = vs0[vhead0].next ∧ ps0[vs0[vhead0].next].next = null, vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs0[vhead0].next ∈ orl ∨ vs0[vhead0].next ∈ qrl ⊦ pc0 = E10 ∧ ¬ obsEmpty0, pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 513 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vs0[vhead0].next].next = null, ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, vs0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ orl, vs0[vhead0].next ∈ ps0, vs0[vhead0].next ∈ vs0, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs0[vhead0].next ∈ orl ∨ vs0[vhead0].next ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) Used terms: mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 514 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 515 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vhead0].next = vs0[vhead0].next, ps0[vs0[vhead0].next].next = null, dom vrvHp0 = dom prvHp, pc0 = E11, vhead4 = vs0[vhead0].next, vs0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs0, ps0, owns), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ vs0, phead ∈ orl, vs0[vhead0].next ∈ ps0, vs0[vhead0].next ∈ vs0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 ∈ orl ∨ vhead0 ∈ qrl, vs0[vhead0].next ∈ orl ∨ vs0[vhead0].next ∈ qrl ⊦ pc0 = E10 ∧ ¬ obsEmpty0, pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 516 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[vs0[vhead0].next].next = null, ps0[vhead0].next = vs0[vhead0].next, dom vrvHp0 = dom prvHp, vs0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val, DMSQLInv (mkgs(ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), listp(orl + qrl, vs0, ps0, owns), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead7, vs0), noid(tid, orl + qrl, vhead7, vs0), nonullRetRefs(orl + qrl, vs0, vretRefs0, pretRefs), noowns(tid, owns), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), vs0[vhead0].next ∈ vs0, vs0[vhead0].next ∈ ps0, phead ∈ orl, phead ∈ vs0, phead ∈ ps0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs0[vhead7].next ≠ null ∧ vs0[vs0[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead7].next].deqID.tid)) = Claimed(vs0[vs0[vhead7].next].deqID.tid, vs0[vs0[vhead7].next].val), vs0[vhead0].next ∈ orl ∨ vs0[vhead0].next ∈ qrl, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs0)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs0), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs0[qrl.last].deqID = None ∧ vs0[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) Used terms: mkgs (ps0, vs0, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, vs0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 517 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 518 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = E14, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (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) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl:= qrl1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl1, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps:= ps1 = mkgs (ps1, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ gstepf(gs, ls, E14, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + gs.vs[ls.lst].next ;gs.qrl )) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(gs.vs[ls.lst].next; None) ;gs.owns ); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ D26 ≠ E14; (s) ⊦ D25 ≠ E14; (s) ⊦ E14 ≠ E17; (s) ⊦ E12 ≠ E14; (s) ⊦ E1 ≠ E14; (s) ⊦ D33 ≠ E14; (s) ⊦ D32 ≠ E14; (s) ⊦ D31 ≠ E14; (s) ⊦ D30 ≠ E14; (s) ⊦ D29 ≠ E14; (s) ⊦ D28 ≠ E14; (s) ⊦ D27 ≠ E14; (s) ⊦ D24 ≠ E14; (s) ⊦ D23 ≠ E14; (s) ⊦ D22 ≠ E14; (s) ⊦ D21 ≠ E14; (s) ⊦ D20 ≠ E14; (s) ⊦ D19 ≠ E14; (s) ⊦ D18 ≠ E14; (s) ⊦ D17 ≠ E14; (s) ⊦ D16 ≠ E14; (s) ⊦ D15 ≠ E14; (s) ⊦ D13 ≠ E14; (s) ⊦ D12 ≠ E14; (s) ⊦ D11 ≠ E14; (s) ⊦ D10 ≠ E14; (s) ⊦ D9 ≠ E14; (s) ⊦ D8 ≠ E14; (s) ⊦ D7 ≠ E14; (s) ⊦ D6 ≠ E14; (s) ⊦ D5 ≠ E14; (s) ⊦ D4 ≠ E14; (s) ⊦ D3 ≠ E14; (s) ⊦ D2 ≠ E14; (s) ⊦ D1 ≠ E14; (s) ⊦ E14 ≠ ready; (s) ⊦ E14 ≠ idle; (s) ⊦ E14 ≠ crashed; (s) ⊦ E13 ≠ E14; (s) ⊦ E11 ≠ E14; (s) ⊦ E10 ≠ E14; (s) ⊦ E9 ≠ E14; (s) ⊦ E8 ≠ E14; (s) ⊦ E7 ≠ E14; (s) ⊦ E6 ≠ E14; (s) ⊦ E5 ≠ E14; (s) ⊦ E4 ≠ E14; (s) ⊦ E3 ≠ E14; (s) ⊦ E2 ≠ E14; (s) ⊦ E14 ≠ E16; (s) ⊦ E14 ≠ E15; (s) ⊦ doEnq(tid) ≠ τ; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ D34 ≠ E14; (s) ⊦ D14 ≠ E14; (s)

Proof step 519 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 520 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 521 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E10, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = 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] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ E4 ≠ E10; (s)

Proof step 522 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 523 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 524 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, vhead0 ≠ (phead0 ' + orl0).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0 ⊦

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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last], <all paths>

Additional information

Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last

Proof step 525 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 526 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, (orl + (phead0 ' + orl0).butlast).last = vhead0, vs[(phead0 ' + orl0).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ obsEmpty0 → vhead4 = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, vhead0 ≠ (phead0 ' + orl0).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 527 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ phead0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 528 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 529 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ phead0, vhead ≠ null, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E10 = D3 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D4 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D5 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D6 → ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .prvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = D8 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D9 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D10 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D11 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D12 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E10 = D13 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D14 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D15 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E10 = D16 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D17 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D18 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D19 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl .head ] .deqID = Some (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E10 = D21 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl .head ] .deqID = Some (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E10 = D22 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D23 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D24 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D25 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (( mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps ⊕ mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs )[mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps ⊕ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs )[mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val)), E10 = D26 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val)), E10 = D27 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val)), E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D29 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D31 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D34 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = E2 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E3 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E5 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E6 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail), E10 = E7 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E8 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E9 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E10 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E11 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E12 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E10 = E13 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E14 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E15 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, E10 = E4 ∨ E10 = E10 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D13 ∨ E10 = D14 ∨ E10 = D15 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → ¬ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl from mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 → mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead ≠ mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → noid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 → noid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → noid (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 ∨ E10 = E1 ∨ E10 = E12 ∨ E10 = E17 → noowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → oneowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps), E10 = E10 → (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ), E10 = E11 → ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ;noowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ), E10 = E4 → (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ;oneowns (mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid1, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) 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) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E10 ≠ E11; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ ready; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ E17; (s) ⊦ D2 ≠ E10; (s) ⊦ D1 ≠ E10; (s)

Proof step 530 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid1, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als

Proof step 531 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 532 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .tid = als.tid, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid1), owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid1, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid1, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid1, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∧ ¬ mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .success ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∧ ( mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .success → mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .lst ] .next = null) ∨ E10 = E11 ∧ mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .lst ] .next = null ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .value = als.ival, (E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14) ∧ mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .nxt = null → als.obsEmpty, E10 = D20 ∧ mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .nxt ] .deqID ≠ None ∨ E10 = D21 ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .nxt ] .deqID ≠ None ∨ E10 = D22 → als.oval = mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .optval, E10 = D15 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D6 ∧ mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .success ∨ E10 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls (tid1, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val, optval1, vs[(orl + (phead0 ' + orl0).butlast).last].next, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0) .tid) ], (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s)

Proof step 533 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val = als.ival, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(als.tid), owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead ≠ phead0, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(als.tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(als.tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(als.tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val0, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 534 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val = val0, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), als = mkls(tid0, obsEmpty, val0, optval, val1, optval0), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid0), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid0, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 535 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid0), owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps, orl + phead0 ' + orl0, owns, (orl + (phead0 ' + orl0).butlast).last, vs

Proof step 536 from proof fwsim-tau-othertid (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 537 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid0), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid0, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), listp(orl + phead0 ' + orl0, vs, ps, owns) ∧ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 → (∃ rl1, rl2. orl + phead0 ' + orl0 = rl1 + (orl + (phead0 ' + orl0).butlast).last ' + rl2 ∧ listp((orl + (phead0 ' + orl0).butlast).last ' + rl2, vs, ps, owns)), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

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)

Proof step 538 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid0), owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: orl2

Additional information

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

Proof step 539 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, orl2 = [], owns(vhead) = Some(tid), owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid0), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vhead ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid0, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ weak?(Weak(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ 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 540 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ', vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].next = null, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].val = vs[(orl + (phead0 ' + orl0).butlast).last].val, ps[vs[(orl + (phead0 ' + orl0).butlast).last].next] = vs[vs[(orl + (phead0 ' + orl0).butlast).last].next], vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns((orl + (phead0 ' + orl0).butlast).last) = None, owns(vhead) = Some(tid), owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid0), (orl + (phead0 ' + orl0).butlast).last ≠ null, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead ≠ phead0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid0, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps, vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs, (orl + (phead0 ' + orl0).butlast).last ∈ ps, (orl + (phead0 ' + orl0).butlast).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[(orl + (phead0 ' + orl0).butlast).last].deqID), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(orl + (phead0 ' + orl0).butlast).last].deqID = vs[(orl + (phead0 ' + orl0).butlast).last].deqID ∨ ps[(orl + (phead0 ' + orl0).butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 541 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 542 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + phead0 ' + orl0.butlast).last ', ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].deqID = None, ps[(orl + phead0 ' + orl0.butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].next = null, ps[(orl + phead0 ' + orl0.butlast).last].val = vs[(orl + phead0 ' + orl0.butlast).last].val, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), ps[vs[(orl + phead0 ' + orl0.butlast).last].next] = vs[vs[(orl + phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + phead0 ' + orl0.butlast).last].next) = Weak(tid0), owns(vhead) = Some(tid), owns((orl + phead0 ' + orl0.butlast).last) = None, (orl + phead0 ' + orl0.butlast).last ≠ null, (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead ≠ null, vhead ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(orl + phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + phead0 ' + orl0.butlast).last ∈ vs, (orl + phead0 ' + orl0.butlast).last ∈ ps, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ vs, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[(orl + phead0 ' + orl0.butlast).last].deqID), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + phead0 ' + orl0.butlast).last ∈ orl ∨ (orl + phead0 ' + orl0.butlast).last = phead0 ∨ (orl + phead0 ' + orl0.butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), ps[(orl + phead0 ' + orl0.butlast).last].deqID = vs[(orl + phead0 ' + orl0.butlast).last].deqID ∨ ps[(orl + phead0 ' + orl0.butlast).last].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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 543 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (phead0 ' + orl0.butlast).last ', ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None, ps[(phead0 ' + orl0.butlast).last].next = null, vs[orl0.last].next = null, vs[vs[(phead0 ' + orl0.butlast).last].next].next = null, ps[(phead0 ' + orl0.butlast).last].val = vs[(phead0 ' + orl0.butlast).last].val, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), ps[vs[(phead0 ' + orl0.butlast).last].next] = vs[vs[(phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid0), owns(vhead) = Some(tid), owns((phead0 ' + orl0.butlast).last) = None, (phead0 ' + orl0.butlast).last ≠ orl0.last, (phead0 ' + orl0.butlast).last ≠ null, vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, vhead ≠ phead0, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), nextnottid(tid0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), oneweakowns(tid0, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(phead0 ' + orl0.butlast).last].next ∈ vs, vs[(phead0 ' + orl0.butlast).last].next ∈ ps, (phead0 ' + orl0.butlast).last ∈ orl0, (phead0 ' + orl0.butlast).last ∈ vs, (phead0 ' + orl0.butlast).last ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ weak?(vs[(phead0 ' + orl0.butlast).last].deqID), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(phead0 ' + orl0.butlast).last].deqID = vs[(phead0 ' + orl0.butlast).last].deqID ∨ ps[(phead0 ' + orl0.butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 544 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = vhead8 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null) ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 545 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E11, vhead4 = vhead8, vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ↔ ps[vhead8].next = null), orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 546 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 547 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null ↔ ps[(orl + qrl.butlast).last].next = null), orl ≠ [], qrl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 548 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, vhead0 ≠ (phead0 ' + orl0).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0 ⊦

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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last], <all paths>

Additional information

Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last

Proof step 549 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 550 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, (orl + (phead0 ' + orl0).butlast).last = vhead0, vs[(phead0 ' + orl0).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ¬ ( ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null ↔ ps[(orl + (phead0 ' + orl0).butlast).last].next = null), orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, vhead0 ≠ (phead0 ' + orl0).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 551 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps, orl + phead0 ' + orl0, owns, (orl + (phead0 ' + orl0).butlast).last, vs

Proof step 552 from proof fwsim-tau-othertid (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 553 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), listp(orl + phead0 ' + orl0, vs, ps, owns) ∧ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 → (∃ rl1, rl2. orl + phead0 ' + orl0 = rl1 + (orl + (phead0 ' + orl0).butlast).last ' + rl2 ∧ listp((orl + (phead0 ' + orl0).butlast).last ' + rl2, vs, ps, owns)), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 554 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: orl2

Additional information

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

Proof step 555 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ' + orl2, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, orl2 = [], owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + (phead0 ' + orl0).butlast).last ' + orl2, vs, ps, owns), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ 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 556 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + (phead0 ' + orl0).butlast).last ', vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].val = vs[(orl + (phead0 ' + orl0).butlast).last].val, ps[vs[(orl + (phead0 ' + orl0).butlast).last].next] = vs[vs[(orl + (phead0 ' + orl0).butlast).last].next], vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns((orl + (phead0 ' + orl0).butlast).last) = None, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ null, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ phead0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(orl + (phead0 ' + orl0).butlast).last].next)), vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ ps, vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ vs, (orl + (phead0 ' + orl0).butlast).last ∈ ps, (orl + (phead0 ' + orl0).butlast).last ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ weak?(vs[(orl + (phead0 ' + orl0).butlast).last].deqID), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(orl + (phead0 ' + orl0).butlast).last].deqID = vs[(orl + (phead0 ' + orl0).butlast).last].deqID ∨ ps[(orl + (phead0 ' + orl0).butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 557 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 558 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (orl + phead0 ' + orl0.butlast).last ', vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + phead0 ' + orl0.butlast).last].next = null, vs[vs[(orl + phead0 ' + orl0.butlast).last].next].next = null, ps[(orl + phead0 ' + orl0.butlast).last].val = vs[(orl + phead0 ' + orl0.butlast).last].val, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), ps[vs[(orl + phead0 ' + orl0.butlast).last].next] = vs[vs[(orl + phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns(vhead) = Some(tid), owns((orl + phead0 ' + orl0.butlast).last) = None, (orl + phead0 ' + orl0.butlast).last ≠ null, (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid1, vhead ≠ phead0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (orl + phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (orl + phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(orl + phead0 ' + orl0.butlast).last].next)), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, (orl + phead0 ' + orl0.butlast).last ∈ vs, (orl + phead0 ' + orl0.butlast).last ∈ ps, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ vs, vs[(orl + phead0 ' + orl0.butlast).last].next ∈ ps, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ weak?(vs[(orl + phead0 ' + orl0.butlast).last].deqID), ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + phead0 ' + orl0.butlast).last ∈ orl ∨ (orl + phead0 ' + orl0.butlast).last = phead0 ∨ (orl + phead0 ' + orl0.butlast).last ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), ps[(orl + phead0 ' + orl0.butlast).last].deqID = vs[(orl + phead0 ' + orl0.butlast).last].deqID ∨ ps[(orl + phead0 ' + orl0.butlast).last].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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 559 from proof fwsim-tau-othertid (previous step) (back to tree)

orl + phead0 ' + orl0 = orl1 + (phead0 ' + orl0.butlast).last ', vs[orl0.last].deqID = None, ps[phead0].deqID = None, vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = None, vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, vs[vs[(phead0 ' + orl0.butlast).last].next].next = null, ps[(phead0 ' + orl0.butlast).last].val = vs[(phead0 ' + orl0.butlast).last].val, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), ps[vs[(phead0 ' + orl0.butlast).last].next] = vs[vs[(phead0 ' + orl0.butlast).last].next], dom vrvHp = dom prvHp, owns(vhead) = Some(tid), owns((phead0 ' + orl0.butlast).last) = None, (phead0 ' + orl0.butlast).last ≠ orl0.last, (phead0 ' + orl0.butlast).last ≠ null, vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid1, vhead ≠ null, vhead ≠ phead0, DMSQLInv (mkgs(ps, vs, phead, vhead7, (phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, (phead0 ' + orl0.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, (phead0 ' + orl0.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), weak?(owns(vs[(phead0 ' + orl0.butlast).last].next)), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(phead0 ' + orl0.butlast).last].next ∈ vs, vs[(phead0 ' + orl0.butlast).last].next ∈ ps, (phead0 ' + orl0.butlast).last ∈ orl0, (phead0 ' + orl0.butlast).last ∈ vs, (phead0 ' + orl0.butlast).last ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ weak?(vs[(phead0 ' + orl0.butlast).last].deqID), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), ps[(phead0 ' + orl0.butlast).last].deqID = vs[(phead0 ' + orl0.butlast).last].deqID ∨ ps[(phead0 ' + orl0.butlast).last].deqID = None, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

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

Proof step 560 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ;pc0 = D21 → (ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 561 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D20, vs[vhead0].next ≠ null, ¬(obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 562 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, ¬(obsEmpty0 → ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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

Additional information

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

Proof step 563 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 564 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D21, vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 565 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, ¬(ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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

Additional information

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

Proof step 566 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 567 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 568 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 569 from proof fwsim-tau-othertid (previous step) (back to tree)

mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 570 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls (mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 571 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 572 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs (ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vtail ∧ mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps[vhead0, ps[vhead0].next:= vs[vhead0].next], vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 573 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val2, val1, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 574 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), als = mkls(tid0, obsEmpty, val1, optval, val2, optval0), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 575 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 41

Additional information

Proof step 576 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 577 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 53

Additional information

Proof step 578 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E10, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

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] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 579 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ps[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 580 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ps[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 581 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ps[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead ≠ phead0, vhead0 ≠ (phead0 ' + orl0).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 582 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 583 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ps[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead ≠ phead0, vhead0 ≠ (phead0 ' + orl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), E10 = D3 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D4 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D5 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D6 → ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ]) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ∨ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ Pending (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = D8 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D9 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D10 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D11 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next) ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next), E10 = D12 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next), E10 = D13 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D14 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null, E10 = D15 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] = Empty, E10 = D16 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D17 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = D18 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D19 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl .head ] .deqID = Some (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success) ∧ (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ), E10 = D21 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first) ∧ noid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl .head ] .deqID = Some (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first), E10 = D22 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D23 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D24 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ], E10 = D25 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (( mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps ⊕ mkgs (ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps ⊕ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vs )[mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID .tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val)), E10 = D26 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val)), E10 = D27 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vhead = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval .val)), E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID = Some (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D29 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).othertid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val), E10 = D31 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ] .next, E10 = D34 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ] ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Empty ⊃ Pending (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ;Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ), E10 = E2 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E3 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E5 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E6 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail), E10 = E7 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E8 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E9 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst), E10 = E10 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E11 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] .val = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value ∧ ( mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vtail ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Weak (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∨ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node), E10 = E12 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null, E10 = E13 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E14 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E15 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ≠ null, E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, E10 = E4 ∨ E10 = E10 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node) = Some(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null) ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mk (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).value, None, null), E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ] = mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node ], E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = D13 ∨ E10 = D14 ∨ E10 = D15 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Pending(mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → ¬ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success, E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl from mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst, E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .qrl from mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .pretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) = mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).rvref ≠ null, E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns) .vretRefs (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid)) = Claimed (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval.val) ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 → mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ∈ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vrvHp ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).addr ≠ null ∧ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval = Val (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .val), E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead ≠ mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first → nextnottid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = E1 ∨ E10 = E2 ∨ E10 = E3 ∨ E10 = E4 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E10 ∨ E10 = E11 ∨ E10 = E12 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 ∨ E10 = E17 ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D18 ∨ E10 = D19 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).first, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = D22 ∨ E10 = D23 ∨ E10 = D24 → noid (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).qrl, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs), E10 = crashed ∨ E10 = idle ∨ E10 = ready ∨ E10 = D1 ∨ E10 = D2 ∨ E10 = D3 ∨ E10 = D4 ∨ E10 = D5 ∨ E10 = D6 ∨ E10 = D7 ∨ E10 = D8 ∨ E10 = D9 ∨ E10 = D10 ∨ E10 = D11 ∨ E10 = D12 ∨ E10 = D13 ∨ E10 = D14 ∨ E10 = D15 ∨ E10 = D16 ∨ E10 = D17 ∨ E10 = D18 ∨ E10 = D19 ∨ E10 = D20 ∨ E10 = D21 ∨ E10 = D22 ∨ E10 = D23 ∨ E10 = D24 ∨ E10 = D25 ∨ E10 = D26 ∨ E10 = D27 ∨ E10 = D28 ∨ E10 = D29 ∨ E10 = D30 ∨ E10 = D31 ∨ E10 = D32 ∨ E10 = D33 ∨ E10 = D34 ∨ E10 = E1 ∨ E10 = E12 ∨ E10 = E17 → noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns), E10 = E2 ∨ E10 = E3 ∨ E10 = E5 ∨ E10 = E6 ∨ E10 = E7 ∨ E10 = E8 ∨ E10 = E9 ∨ E10 = E13 ∨ E10 = E14 ∨ E10 = E15 ∨ E10 = E16 → oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps), E10 = E10 → (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ), E10 = E11 → ( mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ≠ mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs [mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next ⊃ oneweakowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ;noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ), E10 = E4 → (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ⊃ noowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns) ;oneowns (mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid, mkls(tid0, val0, optval1, vhead3, nd0, true, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0).node, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns).ps) ), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) 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) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ E10 ≠ E11; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ ready; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ E17; (s) ⊦ D2 ≠ E10; (s) ⊦ D1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 584 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = vs[(orl + (phead0 ' + orl0).butlast).last].next, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, vs[vhead0].next ≠ null, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].val ≠ val1, orl ≠ [], tid ≠ tid0, vhead ≠ phead0, vhead ≠ null, vhead0 ≠ (phead0 ' + orl0).last, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid0, vhead7, vs), nextnottid(tid, vhead7, vs), noid(tid0, orl + phead0 ' + orl0, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid0, owns), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ vhead ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), (orl + (phead0 ' + orl0).butlast).last ∈ orl ∨ (orl + (phead0 ' + orl0).butlast).last = phead0 ∨ (orl + (phead0 ' + orl0).butlast).last ∈ orl0, vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦

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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last

Proof step 585 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 586 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead8].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E11, vhead4 = vhead8, vs[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null), pc0 = E4 ∧ ¬ obsEmpty0

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] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 587 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ps[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 588 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[qrl.last].deqID = None, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, vs[vhead0].next ≠ null, ps[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead0 ≠ qrl.last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + qrl.butlast).last, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, (orl + qrl.butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 589 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][(orl + (phead0 ' + orl0).butlast).last].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[vhead0].next ≠ null, ps[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, vhead ≠ phead0, vhead0 ≠ (phead0 ' + orl0).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, (orl + (phead0 ' + orl0).butlast).last, vretRefs, pretRefs, vrvHp, prvHp, phead0 ' + orl0, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, (orl + (phead0 ' + orl0).butlast).last, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + phead0 ' + orl0, vhead7, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead ∈ orl, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ vhead ∈ orl0, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), orl.last = vhead7 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs), vhead0 ∈ orl ∨ vhead0 = phead0 ∨ vhead0 ∈ orl0 ⊦

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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, vhead0, ps[vhead0].next:= vs[vhead0].next, (orl + (phead0 ' + orl0).butlast).last

Proof step 590 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 591 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D22, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 592 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None ⊦ pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None, pc0 = D21 ∧ ps[vhead5].deqID ≠ None

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 42

Additional information

Proof step 593 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, obsEmpty0, owns(vhead) = Some(tid), pc0 = D20, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None, vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ D34; (s) ⊦ D6 ≠ D20; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D15 ≠ D20; (s) ⊦ D20 ≠ D22; (s)

Proof step 594 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None, vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, vhead5], <all paths>

Additional information

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

Proof step 595 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 596 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D21, ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None, vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], pc0 ≠ D22, tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = D21 ∧ ps[vhead5].deqID ≠ None, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ D34; (s) ⊦ D6 ≠ D21; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D15 ≠ D21; (s) ⊦ D21 ≠ D22; (s)

Proof step 597 from proof fwsim-tau-othertid (previous step) (back to tree)

ps[vhead5].deqID = None, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0, ps[vhead0].next:= vs[vhead0].next][vhead5].deqID ≠ None, vs[vhead0].next ≠ null, optval ≠ optval1, orl ≠ [], tid ≠ tid0, vhead ≠ null, vhead0 ≠ (orl + qrl).last, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.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] → [ps, vhead0, ps[vhead0].next:= vs[vhead0].next, vhead5], <all paths>

Additional information

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

Proof step 598 from proof fwsim-tau-othertid (previous step) (back to tree)

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

A spec-lemma

Proof step 599 from proof fwsim-tau-othertid (previous step) (back to tree)

dom vrvHp = dom prvHp, pc = E15, orl ≠ [], pc ≠ D14, pc ≠ D34, tid ≠ tid1, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), pre (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc = D26 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs(tid0)) = Claimed(tid0, vs[ps[vhead2].next].val)), pc = D25 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID ≠ None ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (vhead7 = vhead2 → rvowns(vretRefs((ps ⊕ vs)[ps[vhead2].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[vhead2].next].deqID.tid, vs[ps[vhead2].next].val)), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(tid, owns), pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(tid, orl + qrl, vhead2, vs), pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → noid(tid, orl + qrl, vhead7, vs), pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → nextnottid(tid, vhead7, vs), pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → vretRefs(tid) = rvref ∧ pretRefs(tid) = vretRefs(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null, pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → vhead2 ∈ orl ∧ vhead7 ∈ orl from vhead2, pc = D13 ∨ pc = D15 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = D31 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D30 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D29 → vhead2 ∈ orl ∧ ps[ps[vhead2].next].deqID ≠ None ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D28 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ rvowns(addr) = Claimed(tid0, optval.val), pc = D27 → vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid0) ∧ (vhead7 = vhead2 → rvowns(addr) = Claimed(tid0, optval.val)), pc = D24 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref], pc = D23 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = vrvHp[rvref], pc = D22 → ps[ps[vhead2].next].deqID ≠ None ∧ vhead2 ∈ orl ∧ ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D21 → ps[vhead2].next ≠ null ∧ vhead2 ∈ orl ∧ vhead1 = ps[vhead2].next ∧ vs[ps[vhead2].next].deqID = Some(tid) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2), pc = D20 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val) ∧ (qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid) → vhead7 = vhead2 ∧ obsEmpty) ∧ (obsEmpty ⊃ vs[ps[vhead2].next].deqID = Some(tid) ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[ps[vhead2].next].val) ∧ (ps[ps[vhead2].next].deqID = None → vhead7 = vhead2) ∧ noid(tid, orl + qrl, ps[vhead2].next, vs) ;vs[ps[vhead2].next].deqID ≠ None ∧ noid(tid, orl + qrl, vhead2, vs) ∧ rvowns(vretRefs(tid)) = Pending(tid) ), pc = D19 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next ∧ optval = Val(vs[ps[vhead2].next].val), pc = D18 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next, pc = D17 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = ps[vhead0].next ∧ ps[vhead0].next = vs[vhead0].next ∧ ps[vhead0].next ≠ null, pc = D16 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = D15 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vrvHp[rvref] = Empty ∧ prvHp[rvref] = Empty, pc = D13 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = null, pc = D12 → (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next), pc = D11 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D10 → vhead8 ∈ orl + qrl from vhead0 ∧ (vhead1 ≠ null → vhead1 = vs[vhead2].next) ∧ (vhead2 ≠ vhead0 → ps[vhead2].next ≠ null ∧ vhead1 = ps[vhead2].next), pc = D9 → vhead8 ∈ orl + qrl from vhead0, pc = D8 → vhead8 ∈ orl + qrl from vhead2, pc = D6 → (obsEmpty → optval = vrvHp[rvref] ∧ vrvHp[rvref] = prvHp[rvref]) ∧ rvowns(vretRefs(tid)) = (optval = Empty ∨ ¬ obsEmpty ⊃ Pending(tid);Claimed(tid, optval.val)), pc = D5 → rvowns(vretRefs(tid)) = Pending(tid), pc = D4 → vretRefs(tid) = rvref ∧ rvowns(vretRefs(tid)) = Pending(tid) ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ∈ prvHp ∧ vretRefs(tid) ≠ null, pc = D3 → rvowns(rvref) = Pending(tid) ∧ rvref ∈ vrvHp ∧ rvref ∈ prvHp ∧ rvref ≠ null, pc = E4 → (obsEmpty ⊃ noowns(tid, owns);oneowns(tid, vhead, owns, vs, ps)), pc = E11 → (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns)), pc = E10 → (obsEmpty ⊃ (ps[vhead0].next ≠ vs[vhead0].next ⊃ oneweakowns(tid, vhead, owns, vs, ps);noowns(tid, owns));oneowns(tid, vhead, owns, vs, ps)), pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(tid, vhead, owns, vs, ps), pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(tid, orl + qrl, vhead1, vs), pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → vhead7 ≠ vhead2 → nextnottid(tid, vhead7, vs), pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → addr ∈ vrvHp ∧ addr ≠ null ∧ optval = Val(vs[vhead1].val), pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → obsEmpty ∧ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null ∧ rvowns(vretRefs(tid)) = Claimed(tid, vs[vhead1].val) ∧ optval = Val(vs[vhead1].val), pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead0 ∈ orl + qrl from vhead2, pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → vhead2 ≠ vhead0 ∧ vhead8 ∈ orl + qrl from vhead0, pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ obsEmpty, pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ obsEmpty ∧ rvowns(vretRefs(tid)) = Pending(tid), pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ps[vhead] = vs[vhead], pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vs[vhead] = mk(val, None, null), pc = E4 ∨ pc = E10 → ¬ obsEmpty → ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl ∧ vhead ≠ null ∧ vhead ∈ ps ∧ vhead ∈ vs ∧ owns(vhead) = Some(tid) ∧ vs[vhead] = mk(val, None, null) ∧ ps[vhead] = vs[vhead], pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → vhead ∈ ps ∧ vhead ∈ vs ∧ vhead ≠ null ∧ ¬ vhead ∈ orl ∧ ¬ vhead ∈ qrl, pc = E16 → owns(vhead) = Some(tid), pc = E15 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next = ps[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E14 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ vhead1 = vs[vhead0].next ∧ vs[vhead0].next ≠ null, pc = E13 → owns(vhead) = Some(tid), pc = E12 → obsEmpty ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next ∈ orl ∨ vs[vhead0].next ∈ qrl) ∧ vs[vhead0].next = vhead ∧ ps[vhead0].next = vs[vhead0].next ∧ vs[vhead0].next ∈ ps ∧ vs[vhead0].next ∈ vs ∧ vs[vhead0].next ≠ null, pc = E11 → obsEmpty ∧ vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E10 → obsEmpty → vs[vhead0].next = vhead ∧ vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].val = val ∧ (vhead0 = vhead8 ∧ ps[vhead8].next = null ∧ owns(vs[vhead8].next) = Weak(tid) ∨ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ ps[vhead0].next = vs[vhead0].next), pc = E9 → owns(vhead) = Some(tid) ∧ vhead1 = null ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E8 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E7 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (vhead1 ≠ null → vhead1 = vs[vhead0].next) ∧ (vs[vhead0].next = null → vhead8 = vhead0), pc = E6 → owns(vhead) = Some(tid) ∧ (vhead0 ∈ orl ∨ vhead0 ∈ qrl) ∧ (ps[vhead0].next = null → vhead0 = vhead8), pc = E5 → owns(vhead) = Some(tid), pc = E3 → owns(vhead) = Some(tid), pc = E2 → owns(vhead) = Some(tid), orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ obsEmpty0 → vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ∧ gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .vtail ] .next = null ↔ vhead4 = vhead8 ∧ ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls (gstepf (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid0, addr), pc, τ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail:= phead4 = mkgs (ps, ps0, phead, phead0, phead4, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ gstepf(gs, ls, E15, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ D26 ≠ E15; (s) ⊦ D25 ≠ E15; (s) ⊦ E15 ≠ E17; (s) ⊦ E12 ≠ E15; (s) ⊦ E1 ≠ E15; (s) ⊦ D33 ≠ E15; (s) ⊦ D32 ≠ E15; (s) ⊦ D31 ≠ E15; (s) ⊦ D30 ≠ E15; (s) ⊦ D29 ≠ E15; (s) ⊦ D28 ≠ E15; (s) ⊦ D27 ≠ E15; (s) ⊦ D24 ≠ E15; (s) ⊦ D23 ≠ E15; (s) ⊦ D22 ≠ E15; (s) ⊦ D21 ≠ E15; (s) ⊦ D20 ≠ E15; (s) ⊦ D19 ≠ E15; (s) ⊦ D18 ≠ E15; (s) ⊦ D17 ≠ E15; (s) ⊦ D16 ≠ E15; (s) ⊦ D15 ≠ E15; (s) ⊦ D13 ≠ E15; (s) ⊦ D12 ≠ E15; (s) ⊦ D11 ≠ E15; (s) ⊦ D10 ≠ E15; (s) ⊦ D9 ≠ E15; (s) ⊦ D8 ≠ E15; (s) ⊦ D7 ≠ E15; (s) ⊦ D6 ≠ E15; (s) ⊦ D5 ≠ E15; (s) ⊦ D4 ≠ E15; (s) ⊦ D3 ≠ E15; (s) ⊦ D2 ≠ E15; (s) ⊦ D1 ≠ E15; (s) ⊦ E15 ≠ ready; (s) ⊦ E15 ≠ idle; (s) ⊦ E15 ≠ crashed; (s) ⊦ E14 ≠ E15; (s) ⊦ E13 ≠ E15; (s) ⊦ E11 ≠ E15; (s) ⊦ E10 ≠ E15; (s) ⊦ E9 ≠ E15; (s) ⊦ E8 ≠ E15; (s) ⊦ E7 ≠ E15; (s) ⊦ E6 ≠ E15; (s) ⊦ E5 ≠ E15; (s) ⊦ E4 ≠ E15; (s) ⊦ E3 ≠ E15; (s) ⊦ E2 ≠ E15; (s) ⊦ E15 ≠ E16; (s) ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ D34 ≠ E15; (s) ⊦ D14 ≠ E15; (s)

Proof step 600 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( pc0 ≠ E4 → (pc0 = E10 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → obsEmpty0 → ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )) ∧ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 601 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = E10 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → obsEmpty0 → ps[vhead8].next = null ;(pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 602 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, obsEmpty0, owns(vhead) = Some(tid), pc0 = E10, vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s)

Proof step 603 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead1, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 604 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[phead1].next = null, vs[vhead0].next = ps[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Used simplifier rules: ⊦ 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)

Proof step 605 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps0[phead1].next = null, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(vhead) = Some(tid), vhead8 = vhead0, ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 606 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps0[vhead0].next, ps0[ps0[vhead0].next].next = null, vs[vhead] = mk(val, None, null), ps0[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), absls (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, true, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps0, owns), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps0), phead ∈ orl, phead ∈ vs, vhead ∈ ps0, vhead ∈ vs, phead ∈ ps0, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) Used terms: mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, true, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 607 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 608 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (pc0 = E11 ⊃ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null → ps[vhead8].next = null ; pc0 ≠ D6 → (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) ) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 609 from proof fwsim-tau-othertid (previous step) (back to tree)

(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = E11, vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E11; (s) ⊦ E10 ≠ E11; (s)

Proof step 610 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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, vhead1, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 611 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[phead1].next = null, vs[vhead0].next = ps[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Used simplifier rules: ⊦ 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)

Proof step 612 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps0[phead1].next = null, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(vhead) = Some(tid), vhead8 = vhead0, ps[vhead8].next ≠ null, ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, phead1, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = 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] 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) = 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)

Proof step 613 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps0[vhead0].next, ps0[ps0[vhead0].next].next = null, ps0[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), absls (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps0, owns), markedp(orl, ps0), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), vhead ∈ vs, vhead ∈ ps0, phead ∈ vs, phead ∈ orl, phead ∈ ps0, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) Used terms: mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 614 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 615 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ (pc0 = D20 ⊃ obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None ; pc0 = D21 → ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None) )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 616 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D20, ps[vhead0].next ≠ null, ¬ ( obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E11; (s) ⊦ D6 ≠ D20; (s)

Proof step 617 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, ¬ ( obsEmpty0 → (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead1, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 618 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, ¬(obsEmpty0 → ps0[vhead5].deqID = None ↔ obsEmpty0 → ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D20, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 619 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), pc0 = D21, ps[vhead0].next ≠ null, ¬ ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], pc0 ≠ D20, pc0 ≠ D6, pc0 ≠ E11, pc0 ≠ E10, pc0 ≠ E4, tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D6 ≠ D21; (s) ⊦ D20 ≠ D21; (s)

Proof step 620 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, ¬ ( (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

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, vhead1, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 621 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, ¬(ps0[vhead5].deqID = None ↔ ps[vhead5].deqID = None), orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), D21, als), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 622 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), absls (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 623 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 624 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid = als.tid, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid1, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty, pc0 = D20 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid1, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ], vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s)

Proof step 625 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ absls ((vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [(vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als], <all paths>

Additional information

Used terms: (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), mkls (als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0, als

Proof step 626 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 627 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl, mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid ≠ als.tid ∨ ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null) ∨ pc0 = E11 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).lst ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).value = als.ival) ∨ ¬ ( (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt = null → als.obsEmpty) ∨ ¬ ( pc0 = D20 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).nxt ] .deqID ≠ None ∨ pc0 = D22 → als.oval = mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).optval) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).success ∨ pc0 = D34 → als.oval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0).tid) ]) ⊦

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) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s)

Proof step 628 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ als.tid, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(als.tid, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → als.obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → als.oval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = vrvHp[vretRefs(als.tid)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = als.ival) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → als.oval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → als.oval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (als.tid) ]) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val2, val1, obsEmpty, als, optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, als, oval, tid0, optval

Proof step 629 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), als = mkls(tid0, obsEmpty, val1, optval, val2, optval0), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 630 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ ( obsEmpty0 → vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null) ∨ pc0 = E11 ∧ vhead4 = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ] .next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬ ( pc0 = D20 ∧ obsEmpty0 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D21 ∧ (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [vhead5 ] .deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬ ( pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp [(vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ]) ⊦

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, vhead1, phead1, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, 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, vhead1, vtail, (vhead8 = vhead0 ⊃ mkgs (ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 631 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, (vhead8 = vhead0 ⊃ mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vs[vhead] = mk(val, None, null), ps[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, owns(vhead) = Some(tid), ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, vhead ∈ ps, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)]), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ 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)

Proof step 632 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps[vhead0].next, ps[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead7, ps[vhead0].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead1, phead1, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(vhead) = Some(tid), vhead8 = vhead0, ps[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, vhead ≠ null, DMSQLInv (mkgs(ps, vs, phead, vhead7, vhead8, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, vhead, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vhead ∈ vs, vhead ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = vhead8 ∧ ps[vhead8].next = null) ∨ pc0 = E11 ∧ vhead4 = vhead8 ∧ ps[vhead8].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp[vretRefs(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead8 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead8 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ ( pc0 = E1 ∨ pc0 = E2 ∨ pc0 = E3 ∨ pc0 = E4 ∧ ¬ obsEmpty0 ∨ pc0 = E5 ∨ pc0 = E6 ∨ pc0 = E7 ∨ pc0 = E8 ∨ pc0 = E9 ∨ pc0 = E10 ∧ (obsEmpty0 → vhead4 = phead1 ∧ ps0[phead1].next = null) ∨ pc0 = E11 ∧ vhead4 = phead1 ∧ ps0[phead1].next = null ∨ pc0 = E13 ∨ pc0 = E14 ∨ pc0 = E15 ∨ pc0 = E16 → val0 = val1) ∨ ¬(pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1) ∨ ¬(pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(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] 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) = 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)

Proof step 633 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps0[vhead0].next, ps0[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp0 = dom prvHp, owns(vhead) = Some(tid), ps0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps0, owns), markedp(orl, ps0), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs0, pretRefs), oneowns(tid, vhead, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), vhead ∈ vs, vhead ∈ ps0, phead ∈ vs, phead ∈ orl, phead ∈ ps0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, pc0 = E10 ∧ (obsEmpty0 → vhead4 = ps0[vhead0].next ∧ ps0[ps0[vhead0].next].next = null) ∨ pc0 = E11 ∧ vhead4 = ps0[vhead0].next ∧ ps0[ps0[vhead0].next].next = null ⊦ pc0 = E4 ∧ ¬ obsEmpty0, pc0 = E10 ∧ ¬ obsEmpty0

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 53

Additional information

Proof step 634 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps0[vhead0].next, vs[vhead] = mk(val, None, null), ps0[vhead] = mk(val, None, null), dom vrvHp0 = dom prvHp, owns(vhead) = Some(tid), pc0 = E10, ps0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs, ps0, owns), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs0, pretRefs), oneowns(tid, vhead, owns, vs, ps0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ orl, phead ∈ vs, vhead ∈ ps0, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, obsEmpty0 → vhead4 = ps0[vhead0].next ∧ ps0[ps0[vhead0].next].next = null, vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = E10 ∧ ¬ obsEmpty0, pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ E1 ≠ E10; (s)

Proof step 635 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[ps0[vhead0].next].next = null, vs[vhead0].next = ps0[vhead0].next, vs[vhead] = mk(val, None, null), ps0[vhead] = mk(val, None, null), dom vrvHp0 = dom prvHp, owns(vhead) = Some(tid), ps0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, true, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs, ps0, owns), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs0, pretRefs), oneowns(tid, vhead, owns, vs, ps0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ orl, phead ∈ vs, vhead ∈ ps0, vhead ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) Used terms: mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, true, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E10

Proof step 636 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 637 from proof fwsim-tau-othertid (previous step) (back to tree)

vs[vhead0].next = ps0[vhead0].next, ps0[ps0[vhead0].next].next = null, vs[vhead] = mk(val, None, null), ps0[vhead] = mk(val, None, null), dom vrvHp0 = dom prvHp, owns(vhead) = Some(tid), pc0 = E11, vhead4 = ps0[vhead0].next, ps0[vhead0].next ≠ null, orl ≠ [], pc0 ≠ E1, pc0 ≠ E2, pc0 ≠ E3, pc0 ≠ E5, pc0 ≠ E6, pc0 ≠ E7, pc0 ≠ E8, pc0 ≠ E9, pc0 ≠ E13, pc0 ≠ E14, pc0 ≠ E15, pc0 ≠ E16, tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, vhead4, vhead5, rvref0, optval2, vhead6, tid2, addr0), pc0), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), listp(orl + qrl, vs, ps0, owns), markedp(orl, vs), markedp(orl, ps0), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs0, pretRefs), oneowns(tid, vhead, owns, vs, ps0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns), unmarkedp(qrl, ps0), phead ∈ ps0, phead ∈ orl, phead ∈ vs, vhead ∈ ps0, vhead ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), pc0 = D15 ∨ pc0 = D23 ∨ pc0 = D24 ∨ pc0 = D6 ∧ obsEmpty0 ∨ pc0 = D34 → optval = vrvHp0[vretRefs0(tid0)], pc0 = D20 ∧ obsEmpty0 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D21 ∧ ps0[vhead5].deqID ≠ None ∨ pc0 = D22 → optval = optval1, (pc0 = D10 ∨ pc0 = D11 ∨ pc0 = D12 ∨ pc0 = D13 ∨ pc0 = D14) ∧ vhead5 = null → obsEmpty, vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 ∈ orl ∨ vhead0 ∈ qrl ⊦ pc0 = E10 ∧ ¬ obsEmpty0, pc0 = E4 ∧ ¬ obsEmpty0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ E1 ≠ E11; (s)

Proof step 638 from proof fwsim-tau-othertid (previous step) (back to tree)

ps0[ps0[vhead0].next].next = null, vs[vhead0].next = ps0[vhead0].next, ps0[vhead] = mk(val, None, null), vs[vhead] = mk(val, None, null), dom vrvHp0 = dom prvHp, owns(vhead) = Some(tid), ps0[vhead0].next ≠ null, orl ≠ [], tid ≠ tid0, val0 ≠ val1, vhead ≠ null, DMSQLInv (mkgs(ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val0, optval1, vhead3, nd0, obsEmpty0, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps0, owns), markedp(orl, ps0), markedp(orl, vs), nextnottid(tid, vhead7, vs), noid(tid, orl + qrl, vhead7, vs), nonullRetRefs(orl + qrl, vs, vretRefs0, pretRefs), oneowns(tid, vhead, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps0), vhead ∈ vs, vhead ∈ ps0, phead ∈ vs, phead ∈ orl, phead ∈ ps0, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl, vs[vhead7].next ≠ null ∧ vs[vs[vhead7].next].deqID ≠ None → rvowns(vretRefs0(vs[vs[vhead7].next].deqID.tid)) = Claimed(vs[vs[vhead7].next].deqID.tid, vs[vs[vhead7].next].val), vhead0 ∈ orl ∨ vhead0 ∈ qrl, orl.last = vhead7 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead7 ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vhead0 = (orl + qrl).last ∨ qrl ≠ [] ∧ vhead0 = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D7 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .node = node; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) Used terms: mkgs (ps0, vs, phead, vhead7, vhead0, vretRefs0, pretRefs, vrvHp0, prvHp, qrl, orl, owns, rvowns), mkls (tid0, val0, optval1, vhead3, nd0, obsEmpty0, ps0[vhead0].next, vhead5, rvref0, optval2, vhead6, tid2, addr0), E11

Proof step 639 from proof fwsim-tau-othertid (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → 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)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof Tree for fwsim-tau-othertid (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