YES(?,O(n^1)) * Step 1: UnsatPaths WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. evalaaron2start(A,B,C) -> evalaaron2entryin(A,B,C) True (1,1) 1. evalaaron2entryin(A,B,C) -> evalaaron2bb6in(A,C,B) [A >= 0] (?,1) 2. evalaaron2entryin(A,B,C) -> evalaaron2returnin(A,B,C) [0 >= 1 + A] (?,1) 3. evalaaron2bb6in(A,B,C) -> evalaaron2returnin(A,B,C) [B >= 1 + C] (?,1) 4. evalaaron2bb6in(A,B,C) -> evalaaron2returnin(A,B,C) [0 >= 1 + A] (?,1) 5. evalaaron2bb6in(A,B,C) -> evalaaron2bb3in(A,B,C) [C >= B && A >= 0] (?,1) 6. evalaaron2bb3in(A,B,C) -> evalaaron2bb4in(A,B,C) [0 >= 1 + D] (?,1) 7. evalaaron2bb3in(A,B,C) -> evalaaron2bb4in(A,B,C) [D >= 1] (?,1) 8. evalaaron2bb3in(A,B,C) -> evalaaron2bb5in(A,B,C) True (?,1) 9. evalaaron2bb4in(A,B,C) -> evalaaron2bb6in(A,B,-1 + -1*A + C) True (?,1) 10. evalaaron2bb5in(A,B,C) -> evalaaron2bb6in(A,1 + A + B,C) True (?,1) 11. evalaaron2returnin(A,B,C) -> evalaaron2stop(A,B,C) True (?,1) Signature: {(evalaaron2bb3in,3) ;(evalaaron2bb4in,3) ;(evalaaron2bb5in,3) ;(evalaaron2bb6in,3) ;(evalaaron2entryin,3) ;(evalaaron2returnin,3) ;(evalaaron2start,3) ;(evalaaron2stop,3)} Flow Graph: [0->{1,2},1->{3,4,5},2->{11},3->{11},4->{11},5->{6,7,8},6->{9},7->{9},8->{10},9->{3,4,5},10->{3,4,5} ,11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,4)] * Step 2: FromIts WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. evalaaron2start(A,B,C) -> evalaaron2entryin(A,B,C) True (1,1) 1. evalaaron2entryin(A,B,C) -> evalaaron2bb6in(A,C,B) [A >= 0] (?,1) 2. evalaaron2entryin(A,B,C) -> evalaaron2returnin(A,B,C) [0 >= 1 + A] (?,1) 3. evalaaron2bb6in(A,B,C) -> evalaaron2returnin(A,B,C) [B >= 1 + C] (?,1) 4. evalaaron2bb6in(A,B,C) -> evalaaron2returnin(A,B,C) [0 >= 1 + A] (?,1) 5. evalaaron2bb6in(A,B,C) -> evalaaron2bb3in(A,B,C) [C >= B && A >= 0] (?,1) 6. evalaaron2bb3in(A,B,C) -> evalaaron2bb4in(A,B,C) [0 >= 1 + D] (?,1) 7. evalaaron2bb3in(A,B,C) -> evalaaron2bb4in(A,B,C) [D >= 1] (?,1) 8. evalaaron2bb3in(A,B,C) -> evalaaron2bb5in(A,B,C) True (?,1) 9. evalaaron2bb4in(A,B,C) -> evalaaron2bb6in(A,B,-1 + -1*A + C) True (?,1) 10. evalaaron2bb5in(A,B,C) -> evalaaron2bb6in(A,1 + A + B,C) True (?,1) 11. evalaaron2returnin(A,B,C) -> evalaaron2stop(A,B,C) True (?,1) Signature: {(evalaaron2bb3in,3) ;(evalaaron2bb4in,3) ;(evalaaron2bb5in,3) ;(evalaaron2bb6in,3) ;(evalaaron2entryin,3) ;(evalaaron2returnin,3) ;(evalaaron2start,3) ;(evalaaron2stop,3)} Flow Graph: [0->{1,2},1->{3,5},2->{11},3->{11},4->{11},5->{6,7,8},6->{9},7->{9},8->{10},9->{3,4,5},10->{3,4,5},11->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold WORST_CASE(?,O(n^1)) + Considered Problem: Rules: evalaaron2start(A,B,C) -> evalaaron2entryin(A,B,C) True evalaaron2entryin(A,B,C) -> evalaaron2bb6in(A,C,B) [A >= 0] evalaaron2entryin(A,B,C) -> evalaaron2returnin(A,B,C) [0 >= 1 + A] evalaaron2bb6in(A,B,C) -> evalaaron2returnin(A,B,C) [B >= 1 + C] evalaaron2bb6in(A,B,C) -> evalaaron2returnin(A,B,C) [0 >= 1 + A] evalaaron2bb6in(A,B,C) -> evalaaron2bb3in(A,B,C) [C >= B && A >= 0] evalaaron2bb3in(A,B,C) -> evalaaron2bb4in(A,B,C) [0 >= 1 + D] evalaaron2bb3in(A,B,C) -> evalaaron2bb4in(A,B,C) [D >= 1] evalaaron2bb3in(A,B,C) -> evalaaron2bb5in(A,B,C) True evalaaron2bb4in(A,B,C) -> evalaaron2bb6in(A,B,-1 + -1*A + C) True evalaaron2bb5in(A,B,C) -> evalaaron2bb6in(A,1 + A + B,C) True evalaaron2returnin(A,B,C) -> evalaaron2stop(A,B,C) True Signature: {(evalaaron2bb3in,3) ;(evalaaron2bb4in,3) ;(evalaaron2bb5in,3) ;(evalaaron2bb6in,3) ;(evalaaron2entryin,3) ;(evalaaron2returnin,3) ;(evalaaron2start,3) ;(evalaaron2stop,3)} Rule Graph: [0->{1,2},1->{3,5},2->{11},3->{11},4->{11},5->{6,7,8},6->{9},7->{9},8->{10},9->{3,4,5},10->{3,4,5},11->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks WORST_CASE(?,O(n^1)) + Considered Problem: Rules: evalaaron2start.0(A,B,C) -> evalaaron2entryin.1(A,B,C) True evalaaron2start.0(A,B,C) -> evalaaron2entryin.2(A,B,C) True evalaaron2entryin.1(A,B,C) -> evalaaron2bb6in.3(A,C,B) [A >= 0] evalaaron2entryin.1(A,B,C) -> evalaaron2bb6in.5(A,C,B) [A >= 0] evalaaron2entryin.2(A,B,C) -> evalaaron2returnin.11(A,B,C) [0 >= 1 + A] evalaaron2bb6in.3(A,B,C) -> evalaaron2returnin.11(A,B,C) [B >= 1 + C] evalaaron2bb6in.4(A,B,C) -> evalaaron2returnin.11(A,B,C) [0 >= 1 + A] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.6(A,B,C) [C >= B && A >= 0] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.7(A,B,C) [C >= B && A >= 0] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.8(A,B,C) [C >= B && A >= 0] evalaaron2bb3in.6(A,B,C) -> evalaaron2bb4in.9(A,B,C) [0 >= 1 + D] evalaaron2bb3in.7(A,B,C) -> evalaaron2bb4in.9(A,B,C) [D >= 1] evalaaron2bb3in.8(A,B,C) -> evalaaron2bb5in.10(A,B,C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.3(A,B,-1 + -1*A + C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.4(A,B,-1 + -1*A + C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.5(A,B,-1 + -1*A + C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.3(A,1 + A + B,C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.4(A,1 + A + B,C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.5(A,1 + A + B,C) True evalaaron2returnin.11(A,B,C) -> evalaaron2stop.12(A,B,C) True Signature: {(evalaaron2bb3in.6,3) ;(evalaaron2bb3in.7,3) ;(evalaaron2bb3in.8,3) ;(evalaaron2bb4in.9,3) ;(evalaaron2bb5in.10,3) ;(evalaaron2bb6in.3,3) ;(evalaaron2bb6in.4,3) ;(evalaaron2bb6in.5,3) ;(evalaaron2entryin.1,3) ;(evalaaron2entryin.2,3) ;(evalaaron2returnin.11,3) ;(evalaaron2start.0,3) ;(evalaaron2stop.12,3)} Rule Graph: [0->{2,3},1->{4},2->{5},3->{7,8,9},4->{19},5->{19},6->{19},7->{10},8->{11},9->{12},10->{13,14,15},11->{13 ,14,15},12->{16,17,18},13->{5},14->{6},15->{7,8,9},16->{5},17->{6},18->{7,8,9},19->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose WORST_CASE(?,O(n^1)) + Considered Problem: Rules: evalaaron2start.0(A,B,C) -> evalaaron2entryin.1(A,B,C) True evalaaron2start.0(A,B,C) -> evalaaron2entryin.2(A,B,C) True evalaaron2entryin.1(A,B,C) -> evalaaron2bb6in.3(A,C,B) [A >= 0] evalaaron2entryin.1(A,B,C) -> evalaaron2bb6in.5(A,C,B) [A >= 0] evalaaron2entryin.2(A,B,C) -> evalaaron2returnin.11(A,B,C) [0 >= 1 + A] evalaaron2bb6in.3(A,B,C) -> evalaaron2returnin.11(A,B,C) [B >= 1 + C] evalaaron2bb6in.4(A,B,C) -> evalaaron2returnin.11(A,B,C) [0 >= 1 + A] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.6(A,B,C) [C >= B && A >= 0] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.7(A,B,C) [C >= B && A >= 0] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.8(A,B,C) [C >= B && A >= 0] evalaaron2bb3in.6(A,B,C) -> evalaaron2bb4in.9(A,B,C) [0 >= 1 + D] evalaaron2bb3in.7(A,B,C) -> evalaaron2bb4in.9(A,B,C) [D >= 1] evalaaron2bb3in.8(A,B,C) -> evalaaron2bb5in.10(A,B,C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.3(A,B,-1 + -1*A + C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.4(A,B,-1 + -1*A + C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.5(A,B,-1 + -1*A + C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.3(A,1 + A + B,C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.4(A,1 + A + B,C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.5(A,1 + A + B,C) True evalaaron2returnin.11(A,B,C) -> evalaaron2stop.12(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True Signature: {(evalaaron2bb3in.6,3) ;(evalaaron2bb3in.7,3) ;(evalaaron2bb3in.8,3) ;(evalaaron2bb4in.9,3) ;(evalaaron2bb5in.10,3) ;(evalaaron2bb6in.3,3) ;(evalaaron2bb6in.4,3) ;(evalaaron2bb6in.5,3) ;(evalaaron2entryin.1,3) ;(evalaaron2entryin.2,3) ;(evalaaron2returnin.11,3) ;(evalaaron2start.0,3) ;(evalaaron2stop.12,3) ;(exitus616,3)} Rule Graph: [0->{2,3},1->{4},2->{5},3->{7,8,9},4->{19},5->{19},6->{19},7->{10},8->{11},9->{12},10->{13,14,15},11->{13 ,14,15},12->{16,17,18},13->{5},14->{6},15->{7,8,9},16->{5},17->{6},18->{7,8,9},19->{20,21,22,23,24,25}] + 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,20,21,22,23,24,25] | `- p:[7,15,10,11,8,18,12,9] c: [7,8,9,10,11,12,15,18] * Step 6: AbstractSize WORST_CASE(?,O(n^1)) + Considered Problem: (Rules: evalaaron2start.0(A,B,C) -> evalaaron2entryin.1(A,B,C) True evalaaron2start.0(A,B,C) -> evalaaron2entryin.2(A,B,C) True evalaaron2entryin.1(A,B,C) -> evalaaron2bb6in.3(A,C,B) [A >= 0] evalaaron2entryin.1(A,B,C) -> evalaaron2bb6in.5(A,C,B) [A >= 0] evalaaron2entryin.2(A,B,C) -> evalaaron2returnin.11(A,B,C) [0 >= 1 + A] evalaaron2bb6in.3(A,B,C) -> evalaaron2returnin.11(A,B,C) [B >= 1 + C] evalaaron2bb6in.4(A,B,C) -> evalaaron2returnin.11(A,B,C) [0 >= 1 + A] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.6(A,B,C) [C >= B && A >= 0] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.7(A,B,C) [C >= B && A >= 0] evalaaron2bb6in.5(A,B,C) -> evalaaron2bb3in.8(A,B,C) [C >= B && A >= 0] evalaaron2bb3in.6(A,B,C) -> evalaaron2bb4in.9(A,B,C) [0 >= 1 + D] evalaaron2bb3in.7(A,B,C) -> evalaaron2bb4in.9(A,B,C) [D >= 1] evalaaron2bb3in.8(A,B,C) -> evalaaron2bb5in.10(A,B,C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.3(A,B,-1 + -1*A + C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.4(A,B,-1 + -1*A + C) True evalaaron2bb4in.9(A,B,C) -> evalaaron2bb6in.5(A,B,-1 + -1*A + C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.3(A,1 + A + B,C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.4(A,1 + A + B,C) True evalaaron2bb5in.10(A,B,C) -> evalaaron2bb6in.5(A,1 + A + B,C) True evalaaron2returnin.11(A,B,C) -> evalaaron2stop.12(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True evalaaron2stop.12(A,B,C) -> exitus616(A,B,C) True Signature: {(evalaaron2bb3in.6,3) ;(evalaaron2bb3in.7,3) ;(evalaaron2bb3in.8,3) ;(evalaaron2bb4in.9,3) ;(evalaaron2bb5in.10,3) ;(evalaaron2bb6in.3,3) ;(evalaaron2bb6in.4,3) ;(evalaaron2bb6in.5,3) ;(evalaaron2entryin.1,3) ;(evalaaron2entryin.2,3) ;(evalaaron2returnin.11,3) ;(evalaaron2start.0,3) ;(evalaaron2stop.12,3) ;(exitus616,3)} Rule Graph: [0->{2,3},1->{4},2->{5},3->{7,8,9},4->{19},5->{19},6->{19},7->{10},8->{11},9->{12},10->{13,14,15},11->{13 ,14,15},12->{16,17,18},13->{5},14->{6},15->{7,8,9},16->{5},17->{6},18->{7,8,9},19->{20,21,22,23,24,25}] ,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,20,21,22,23,24,25] | `- p:[7,15,10,11,8,18,12,9] c: [7,8,9,10,11,12,15,18]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [A,B,C,0.0] evalaaron2start.0 ~> evalaaron2entryin.1 [A <= A, B <= B, C <= C] evalaaron2start.0 ~> evalaaron2entryin.2 [A <= A, B <= B, C <= C] evalaaron2entryin.1 ~> evalaaron2bb6in.3 [A <= A, B <= C, C <= B] evalaaron2entryin.1 ~> evalaaron2bb6in.5 [A <= A, B <= C, C <= B] evalaaron2entryin.2 ~> evalaaron2returnin.11 [A <= A, B <= B, C <= C] evalaaron2bb6in.3 ~> evalaaron2returnin.11 [A <= A, B <= B, C <= C] evalaaron2bb6in.4 ~> evalaaron2returnin.11 [A <= A, B <= B, C <= C] evalaaron2bb6in.5 ~> evalaaron2bb3in.6 [A <= A, B <= B, C <= C] evalaaron2bb6in.5 ~> evalaaron2bb3in.7 [A <= A, B <= B, C <= C] evalaaron2bb6in.5 ~> evalaaron2bb3in.8 [A <= A, B <= B, C <= C] evalaaron2bb3in.6 ~> evalaaron2bb4in.9 [A <= A, B <= B, C <= C] evalaaron2bb3in.7 ~> evalaaron2bb4in.9 [A <= A, B <= B, C <= C] evalaaron2bb3in.8 ~> evalaaron2bb5in.10 [A <= A, B <= B, C <= C] evalaaron2bb4in.9 ~> evalaaron2bb6in.3 [A <= A, B <= B, C <= K + A + C] evalaaron2bb4in.9 ~> evalaaron2bb6in.4 [A <= A, B <= B, C <= K + A + C] evalaaron2bb4in.9 ~> evalaaron2bb6in.5 [A <= A, B <= B, C <= K + A + C] evalaaron2bb5in.10 ~> evalaaron2bb6in.3 [A <= A, B <= K + A + B, C <= C] evalaaron2bb5in.10 ~> evalaaron2bb6in.4 [A <= A, B <= K + A + B, C <= C] evalaaron2bb5in.10 ~> evalaaron2bb6in.5 [A <= A, B <= K + A + B, C <= C] evalaaron2returnin.11 ~> evalaaron2stop.12 [A <= A, B <= B, C <= C] evalaaron2stop.12 ~> exitus616 [A <= A, B <= B, C <= C] evalaaron2stop.12 ~> exitus616 [A <= A, B <= B, C <= C] evalaaron2stop.12 ~> exitus616 [A <= A, B <= B, C <= C] evalaaron2stop.12 ~> exitus616 [A <= A, B <= B, C <= C] evalaaron2stop.12 ~> exitus616 [A <= A, B <= B, C <= C] evalaaron2stop.12 ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= K + A + B + C] evalaaron2bb6in.5 ~> evalaaron2bb3in.6 [A <= A, B <= B, C <= C] evalaaron2bb4in.9 ~> evalaaron2bb6in.5 [A <= A, B <= B, C <= K + A + C] evalaaron2bb3in.6 ~> evalaaron2bb4in.9 [A <= A, B <= B, C <= C] evalaaron2bb3in.7 ~> evalaaron2bb4in.9 [A <= A, B <= B, C <= C] evalaaron2bb6in.5 ~> evalaaron2bb3in.7 [A <= A, B <= B, C <= C] evalaaron2bb5in.10 ~> evalaaron2bb6in.5 [A <= A, B <= K + A + B, C <= C] evalaaron2bb3in.8 ~> evalaaron2bb5in.10 [A <= A, B <= B, C <= C] evalaaron2bb6in.5 ~> evalaaron2bb3in.8 [A <= A, B <= B, C <= C] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0] evalaaron2start.0 ~> evalaaron2entryin.1 [] evalaaron2start.0 ~> evalaaron2entryin.2 [] evalaaron2entryin.1 ~> evalaaron2bb6in.3 [B ~=> C,C ~=> B] evalaaron2entryin.1 ~> evalaaron2bb6in.5 [B ~=> C,C ~=> B] evalaaron2entryin.2 ~> evalaaron2returnin.11 [] evalaaron2bb6in.3 ~> evalaaron2returnin.11 [] evalaaron2bb6in.4 ~> evalaaron2returnin.11 [] evalaaron2bb6in.5 ~> evalaaron2bb3in.6 [] evalaaron2bb6in.5 ~> evalaaron2bb3in.7 [] evalaaron2bb6in.5 ~> evalaaron2bb3in.8 [] evalaaron2bb3in.6 ~> evalaaron2bb4in.9 [] evalaaron2bb3in.7 ~> evalaaron2bb4in.9 [] evalaaron2bb3in.8 ~> evalaaron2bb5in.10 [] evalaaron2bb4in.9 ~> evalaaron2bb6in.3 [A ~+> C,C ~+> C,K ~+> C] evalaaron2bb4in.9 ~> evalaaron2bb6in.4 [A ~+> C,C ~+> C,K ~+> C] evalaaron2bb4in.9 ~> evalaaron2bb6in.5 [A ~+> C,C ~+> C,K ~+> C] evalaaron2bb5in.10 ~> evalaaron2bb6in.3 [A ~+> B,B ~+> B,K ~+> B] evalaaron2bb5in.10 ~> evalaaron2bb6in.4 [A ~+> B,B ~+> B,K ~+> B] evalaaron2bb5in.10 ~> evalaaron2bb6in.5 [A ~+> B,B ~+> B,K ~+> B] evalaaron2returnin.11 ~> evalaaron2stop.12 [] evalaaron2stop.12 ~> exitus616 [] evalaaron2stop.12 ~> exitus616 [] evalaaron2stop.12 ~> exitus616 [] evalaaron2stop.12 ~> exitus616 [] evalaaron2stop.12 ~> exitus616 [] evalaaron2stop.12 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0,C ~+> 0.0,K ~+> 0.0] evalaaron2bb6in.5 ~> evalaaron2bb3in.6 [] evalaaron2bb4in.9 ~> evalaaron2bb6in.5 [A ~+> C,C ~+> C,K ~+> C] evalaaron2bb3in.6 ~> evalaaron2bb4in.9 [] evalaaron2bb3in.7 ~> evalaaron2bb4in.9 [] evalaaron2bb6in.5 ~> evalaaron2bb3in.7 [] evalaaron2bb5in.10 ~> evalaaron2bb6in.5 [A ~+> B,B ~+> B,K ~+> B] evalaaron2bb3in.8 ~> evalaaron2bb5in.10 [] evalaaron2bb6in.5 ~> evalaaron2bb3in.8 [] + Applied Processor: Lare + Details: evalaaron2start.0 ~> exitus616 [B ~=> C ,C ~=> B ,A ~+> B ,A ~+> C ,A ~+> 0.0 ,A ~+> tick ,B ~+> C ,B ~+> 0.0 ,B ~+> tick ,C ~+> B ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> C ,B ~*> B ,B ~*> C ,C ~*> B ,C ~*> C ,K ~*> B ,K ~*> C] + evalaaron2bb4in.9> [A ~+> B ,A ~+> C ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> C ,B ~*> B ,B ~*> C ,C ~*> B ,C ~*> C ,K ~*> B ,K ~*> C] evalaaron2bb5in.10> [A ~+> B ,A ~+> C ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> 0.0 ,K ~+> tick ,A ~*> B ,A ~*> C ,B ~*> B ,B ~*> C ,C ~*> B ,C ~*> C ,K ~*> B ,K ~*> C] YES(?,O(n^1))