YES(?,PRIMREC) * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalspeedpldi3start(A,B,C,D) -> evalspeedpldi3entryin(A,B,C,D) True (1,1) 1. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [0 >= A] (?,1) 2. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [A >= B] (?,1) 3. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 4. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3bb2in(A,B,C,D) [B >= 1 + D] (?,1) 5. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [D >= B] (?,1) 6. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb3in(A,B,C,D) [A >= 1 + C] (?,1) 7. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb4in(A,B,C,D) [C >= A] (?,1) 8. evalspeedpldi3bb3in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,1 + C,D) True (?,1) 9. evalspeedpldi3bb4in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,1 + D) True (?,1) 10. evalspeedpldi3returnin(A,B,C,D) -> evalspeedpldi3stop(A,B,C,D) True (?,1) Signature: {(evalspeedpldi3bb2in,4) ;(evalspeedpldi3bb3in,4) ;(evalspeedpldi3bb4in,4) ;(evalspeedpldi3bb5in,4) ;(evalspeedpldi3entryin,4) ;(evalspeedpldi3returnin,4) ;(evalspeedpldi3start,4) ;(evalspeedpldi3stop,4)} Flow Graph: [0->{1,2,3},1->{10},2->{10},3->{4,5},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,5)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. evalspeedpldi3start(A,B,C,D) -> evalspeedpldi3entryin(A,B,C,D) True (1,1) 1. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [0 >= A] (?,1) 2. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [A >= B] (?,1) 3. evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 4. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3bb2in(A,B,C,D) [B >= 1 + D] (?,1) 5. evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [D >= B] (?,1) 6. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb3in(A,B,C,D) [A >= 1 + C] (?,1) 7. evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb4in(A,B,C,D) [C >= A] (?,1) 8. evalspeedpldi3bb3in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,1 + C,D) True (?,1) 9. evalspeedpldi3bb4in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,1 + D) True (?,1) 10. evalspeedpldi3returnin(A,B,C,D) -> evalspeedpldi3stop(A,B,C,D) True (?,1) Signature: {(evalspeedpldi3bb2in,4) ;(evalspeedpldi3bb3in,4) ;(evalspeedpldi3bb4in,4) ;(evalspeedpldi3bb5in,4) ;(evalspeedpldi3entryin,4) ;(evalspeedpldi3returnin,4) ;(evalspeedpldi3start,4) ;(evalspeedpldi3stop,4)} Flow Graph: [0->{1,2,3},1->{10},2->{10},3->{4},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: evalspeedpldi3start(A,B,C,D) -> evalspeedpldi3entryin(A,B,C,D) True evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [0 >= A] evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [A >= B] evalspeedpldi3entryin(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,0) [A >= 1 && B >= 1 + A] evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3bb2in(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in(A,B,C,D) -> evalspeedpldi3returnin(A,B,C,D) [D >= B] evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb3in(A,B,C,D) [A >= 1 + C] evalspeedpldi3bb2in(A,B,C,D) -> evalspeedpldi3bb4in(A,B,C,D) [C >= A] evalspeedpldi3bb3in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,1 + C,D) True evalspeedpldi3bb4in(A,B,C,D) -> evalspeedpldi3bb5in(A,B,0,1 + D) True evalspeedpldi3returnin(A,B,C,D) -> evalspeedpldi3stop(A,B,C,D) True Signature: {(evalspeedpldi3bb2in,4) ;(evalspeedpldi3bb3in,4) ;(evalspeedpldi3bb4in,4) ;(evalspeedpldi3bb5in,4) ;(evalspeedpldi3entryin,4) ;(evalspeedpldi3returnin,4) ;(evalspeedpldi3start,4) ;(evalspeedpldi3stop,4)} Rule Graph: [0->{1,2,3},1->{10},2->{10},3->{4},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.1(A,B,C,D) True evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.2(A,B,C,D) True evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.3(A,B,C,D) True evalspeedpldi3entryin.1(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [0 >= A] evalspeedpldi3entryin.2(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [A >= B] evalspeedpldi3entryin.3(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,0,0) [A >= 1 && B >= 1 + A] evalspeedpldi3bb5in.4(A,B,C,D) -> evalspeedpldi3bb2in.6(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in.4(A,B,C,D) -> evalspeedpldi3bb2in.7(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in.5(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [D >= B] evalspeedpldi3bb2in.6(A,B,C,D) -> evalspeedpldi3bb3in.8(A,B,C,D) [A >= 1 + C] evalspeedpldi3bb2in.7(A,B,C,D) -> evalspeedpldi3bb4in.9(A,B,C,D) [C >= A] evalspeedpldi3bb3in.8(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,1 + C,D) True evalspeedpldi3bb3in.8(A,B,C,D) -> evalspeedpldi3bb5in.5(A,B,1 + C,D) True evalspeedpldi3bb4in.9(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,0,1 + D) True evalspeedpldi3bb4in.9(A,B,C,D) -> evalspeedpldi3bb5in.5(A,B,0,1 + D) True evalspeedpldi3returnin.10(A,B,C,D) -> evalspeedpldi3stop.11(A,B,C,D) True Signature: {(evalspeedpldi3bb2in.6,4) ;(evalspeedpldi3bb2in.7,4) ;(evalspeedpldi3bb3in.8,4) ;(evalspeedpldi3bb4in.9,4) ;(evalspeedpldi3bb5in.4,4) ;(evalspeedpldi3bb5in.5,4) ;(evalspeedpldi3entryin.1,4) ;(evalspeedpldi3entryin.2,4) ;(evalspeedpldi3entryin.3,4) ;(evalspeedpldi3returnin.10,4) ;(evalspeedpldi3start.0,4) ;(evalspeedpldi3stop.11,4)} Rule Graph: [0->{3},1->{4},2->{5},3->{15},4->{15},5->{6,7},6->{9},7->{10},8->{15},9->{11,12},10->{13,14},11->{6,7} ,12->{8},13->{6,7},14->{8},15->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose MAYBE + Considered Problem: Rules: evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.1(A,B,C,D) True evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.2(A,B,C,D) True evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.3(A,B,C,D) True evalspeedpldi3entryin.1(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [0 >= A] evalspeedpldi3entryin.2(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [A >= B] evalspeedpldi3entryin.3(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,0,0) [A >= 1 && B >= 1 + A] evalspeedpldi3bb5in.4(A,B,C,D) -> evalspeedpldi3bb2in.6(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in.4(A,B,C,D) -> evalspeedpldi3bb2in.7(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in.5(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [D >= B] evalspeedpldi3bb2in.6(A,B,C,D) -> evalspeedpldi3bb3in.8(A,B,C,D) [A >= 1 + C] evalspeedpldi3bb2in.7(A,B,C,D) -> evalspeedpldi3bb4in.9(A,B,C,D) [C >= A] evalspeedpldi3bb3in.8(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,1 + C,D) True evalspeedpldi3bb3in.8(A,B,C,D) -> evalspeedpldi3bb5in.5(A,B,1 + C,D) True evalspeedpldi3bb4in.9(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,0,1 + D) True evalspeedpldi3bb4in.9(A,B,C,D) -> evalspeedpldi3bb5in.5(A,B,0,1 + D) True evalspeedpldi3returnin.10(A,B,C,D) -> evalspeedpldi3stop.11(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True Signature: {(evalspeedpldi3bb2in.6,4) ;(evalspeedpldi3bb2in.7,4) ;(evalspeedpldi3bb3in.8,4) ;(evalspeedpldi3bb4in.9,4) ;(evalspeedpldi3bb5in.4,4) ;(evalspeedpldi3bb5in.5,4) ;(evalspeedpldi3entryin.1,4) ;(evalspeedpldi3entryin.2,4) ;(evalspeedpldi3entryin.3,4) ;(evalspeedpldi3returnin.10,4) ;(evalspeedpldi3start.0,4) ;(evalspeedpldi3stop.11,4) ;(exitus616,4)} Rule Graph: [0->{3},1->{4},2->{5},3->{15},4->{15},5->{6,7},6->{9},7->{10},8->{15},9->{11,12},10->{13,14},11->{6,7} ,12->{8},13->{6,7},14->{8},15->{16,17,18,19}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] | `- p:[6,11,9,13,10,7] c: [7,10,13] | `- p:[6,11,9] c: [6,9,11] * Step 6: AbstractSize MAYBE + Considered Problem: (Rules: evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.1(A,B,C,D) True evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.2(A,B,C,D) True evalspeedpldi3start.0(A,B,C,D) -> evalspeedpldi3entryin.3(A,B,C,D) True evalspeedpldi3entryin.1(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [0 >= A] evalspeedpldi3entryin.2(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [A >= B] evalspeedpldi3entryin.3(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,0,0) [A >= 1 && B >= 1 + A] evalspeedpldi3bb5in.4(A,B,C,D) -> evalspeedpldi3bb2in.6(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in.4(A,B,C,D) -> evalspeedpldi3bb2in.7(A,B,C,D) [B >= 1 + D] evalspeedpldi3bb5in.5(A,B,C,D) -> evalspeedpldi3returnin.10(A,B,C,D) [D >= B] evalspeedpldi3bb2in.6(A,B,C,D) -> evalspeedpldi3bb3in.8(A,B,C,D) [A >= 1 + C] evalspeedpldi3bb2in.7(A,B,C,D) -> evalspeedpldi3bb4in.9(A,B,C,D) [C >= A] evalspeedpldi3bb3in.8(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,1 + C,D) True evalspeedpldi3bb3in.8(A,B,C,D) -> evalspeedpldi3bb5in.5(A,B,1 + C,D) True evalspeedpldi3bb4in.9(A,B,C,D) -> evalspeedpldi3bb5in.4(A,B,0,1 + D) True evalspeedpldi3bb4in.9(A,B,C,D) -> evalspeedpldi3bb5in.5(A,B,0,1 + D) True evalspeedpldi3returnin.10(A,B,C,D) -> evalspeedpldi3stop.11(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True evalspeedpldi3stop.11(A,B,C,D) -> exitus616(A,B,C,D) True Signature: {(evalspeedpldi3bb2in.6,4) ;(evalspeedpldi3bb2in.7,4) ;(evalspeedpldi3bb3in.8,4) ;(evalspeedpldi3bb4in.9,4) ;(evalspeedpldi3bb5in.4,4) ;(evalspeedpldi3bb5in.5,4) ;(evalspeedpldi3entryin.1,4) ;(evalspeedpldi3entryin.2,4) ;(evalspeedpldi3entryin.3,4) ;(evalspeedpldi3returnin.10,4) ;(evalspeedpldi3start.0,4) ;(evalspeedpldi3stop.11,4) ;(exitus616,4)} Rule Graph: [0->{3},1->{4},2->{5},3->{15},4->{15},5->{6,7},6->{9},7->{10},8->{15},9->{11,12},10->{13,14},11->{6,7} ,12->{8},13->{6,7},14->{8},15->{16,17,18,19}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] | `- p:[6,11,9,13,10,7] c: [7,10,13] | `- p:[6,11,9] c: [6,9,11]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,D,0.0,0.0.0] evalspeedpldi3start.0 ~> evalspeedpldi3entryin.1 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3start.0 ~> evalspeedpldi3entryin.2 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3start.0 ~> evalspeedpldi3entryin.3 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3entryin.1 ~> evalspeedpldi3returnin.10 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3entryin.2 ~> evalspeedpldi3returnin.10 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3entryin.3 ~> evalspeedpldi3bb5in.4 [A <= A, B <= B, C <= 0*K, D <= 0*K] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.6 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.7 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb5in.5 ~> evalspeedpldi3returnin.10 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb2in.6 ~> evalspeedpldi3bb3in.8 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb2in.7 ~> evalspeedpldi3bb4in.9 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.4 [A <= A, B <= B, C <= K + C, D <= D] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.5 [A <= A, B <= B, C <= K + C, D <= D] evalspeedpldi3bb4in.9 ~> evalspeedpldi3bb5in.4 [A <= A, B <= B, C <= 0*K, D <= K + D] evalspeedpldi3bb4in.9 ~> evalspeedpldi3bb5in.5 [A <= A, B <= B, C <= 0*K, D <= K + D] evalspeedpldi3returnin.10 ~> evalspeedpldi3stop.11 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3stop.11 ~> exitus616 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3stop.11 ~> exitus616 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3stop.11 ~> exitus616 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3stop.11 ~> exitus616 [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0 <= B + D] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.6 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.4 [A <= A, B <= B, C <= K + C, D <= D] evalspeedpldi3bb2in.6 ~> evalspeedpldi3bb3in.8 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb4in.9 ~> evalspeedpldi3bb5in.4 [A <= A, B <= B, C <= 0*K, D <= K + D] evalspeedpldi3bb2in.7 ~> evalspeedpldi3bb4in.9 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.7 [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0.0 <= K + A + C] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.6 [A <= A, B <= B, C <= C, D <= D] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.4 [A <= A, B <= B, C <= K + C, D <= D] evalspeedpldi3bb2in.6 ~> evalspeedpldi3bb3in.8 [A <= A, B <= B, C <= C, D <= D] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,0.0,0.0.0] evalspeedpldi3start.0 ~> evalspeedpldi3entryin.1 [] evalspeedpldi3start.0 ~> evalspeedpldi3entryin.2 [] evalspeedpldi3start.0 ~> evalspeedpldi3entryin.3 [] evalspeedpldi3entryin.1 ~> evalspeedpldi3returnin.10 [] evalspeedpldi3entryin.2 ~> evalspeedpldi3returnin.10 [] evalspeedpldi3entryin.3 ~> evalspeedpldi3bb5in.4 [K ~=> C,K ~=> D] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.6 [] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.7 [] evalspeedpldi3bb5in.5 ~> evalspeedpldi3returnin.10 [] evalspeedpldi3bb2in.6 ~> evalspeedpldi3bb3in.8 [] evalspeedpldi3bb2in.7 ~> evalspeedpldi3bb4in.9 [] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.4 [C ~+> C,K ~+> C] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.5 [C ~+> C,K ~+> C] evalspeedpldi3bb4in.9 ~> evalspeedpldi3bb5in.4 [K ~=> C,D ~+> D,K ~+> D] evalspeedpldi3bb4in.9 ~> evalspeedpldi3bb5in.5 [K ~=> C,D ~+> D,K ~+> D] evalspeedpldi3returnin.10 ~> evalspeedpldi3stop.11 [] evalspeedpldi3stop.11 ~> exitus616 [] evalspeedpldi3stop.11 ~> exitus616 [] evalspeedpldi3stop.11 ~> exitus616 [] evalspeedpldi3stop.11 ~> exitus616 [] + Loop: [B ~+> 0.0,D ~+> 0.0] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.6 [] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.4 [C ~+> C,K ~+> C] evalspeedpldi3bb2in.6 ~> evalspeedpldi3bb3in.8 [] evalspeedpldi3bb4in.9 ~> evalspeedpldi3bb5in.4 [K ~=> C,D ~+> D,K ~+> D] evalspeedpldi3bb2in.7 ~> evalspeedpldi3bb4in.9 [] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.7 [] + Loop: [A ~+> 0.0.0,C ~+> 0.0.0,K ~+> 0.0.0] evalspeedpldi3bb5in.4 ~> evalspeedpldi3bb2in.6 [] evalspeedpldi3bb3in.8 ~> evalspeedpldi3bb5in.4 [C ~+> C,K ~+> C] evalspeedpldi3bb2in.6 ~> evalspeedpldi3bb3in.8 [] + Applied Processor: Lare + Details: evalspeedpldi3start.0 ~> exitus616 [K ~=> C ,K ~=> D ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> D ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> C ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> C ,B ~*> D ,B ~*> 0.0.0 ,B ~*> tick ,K ~*> C ,K ~*> D ,K ~*> 0.0.0 ,K ~*> tick ,B ~^> C ,B ~^> 0.0.0 ,B ~^> tick ,K ~^> C ,K ~^> 0.0.0 ,K ~^> tick] + evalspeedpldi3bb3in.8> [K ~=> C ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0.0 ,C ~+> tick ,D ~+> D ,D ~+> 0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> D ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> C ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> C ,B ~*> D ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> C ,C ~*> 0.0.0 ,C ~*> tick ,D ~*> C ,D ~*> D ,D ~*> 0.0.0 ,D ~*> tick ,K ~*> C ,K ~*> D ,K ~*> 0.0.0 ,K ~*> tick ,B ~^> C ,B ~^> 0.0.0 ,B ~^> tick ,D ~^> C ,D ~^> 0.0.0 ,D ~^> tick] evalspeedpldi3bb4in.9> [K ~=> C ,A ~+> 0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0.0 ,C ~+> tick ,D ~+> D ,D ~+> 0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> D ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> C ,A ~*> 0.0.0 ,A ~*> tick ,B ~*> C ,B ~*> D ,B ~*> tick ,C ~*> C ,C ~*> 0.0.0 ,C ~*> tick ,D ~*> C ,D ~*> D ,D ~*> tick ,K ~*> C ,K ~*> D ,K ~*> 0.0.0 ,K ~*> tick ,B ~^> C ,D ~^> C] + evalspeedpldi3bb5in.4> [A ~+> 0.0.0 ,A ~+> tick ,C ~+> C ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> C ,C ~*> C ,K ~*> C] evalspeedpldi3bb3in.8> [A ~+> 0.0.0 ,A ~+> tick ,C ~+> C ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> C ,C ~*> C ,K ~*> C] YES(?,PRIMREC)