YES(?,O(1)) * Step 1: TrivialSCCs WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I) -> f17(0,J,K,0,E,F,G,H,I) True (1,1) 1. f17(A,B,C,D,E,F,G,H,I) -> f17(A,B,C,1 + D,E,F,G,H,I) [49 >= D] (?,1) 2. f27(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,1 + E,F,G,H,I) [49 >= E] (?,1) 3. f37(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,1 + F,G,H,I) [49 >= F] (?,1) 4. f45(A,B,C,D,E,F,G,H,I) -> f45(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 5. f55(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,1 + G,H,I) [49 >= G] (?,1) 6. f65(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,1 + H,I) [49 >= H] (?,1) 7. f75(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,1 + I) [49 >= I] (?,1) 8. f83(A,B,C,D,E,F,G,H,I) -> f83(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 9. f83(A,B,C,D,E,F,G,H,I) -> f93(A,B,C,D,E,F,G,H,I) [A >= 50] (?,1) 10. f75(A,B,C,D,E,F,G,H,I) -> f83(0,B,C,D,E,F,G,H,I) [I >= 50] (?,1) 11. f65(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,0) [H >= 50] (?,1) 12. f55(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,0,I) [G >= 50] (?,1) 13. f45(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,0,H,I) [A >= 50] (?,1) 14. f37(A,B,C,D,E,F,G,H,I) -> f45(0,B,C,D,E,F,G,H,I) [F >= 50] (?,1) 15. f27(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,0,G,H,I) [E >= 50] (?,1) 16. f17(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,0,F,G,H,I) [D >= 50] (?,1) Signature: {(f0,9);(f17,9);(f27,9);(f37,9);(f45,9);(f55,9);(f65,9);(f75,9);(f83,9);(f93,9)} Flow Graph: [0->{1,16},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9},9->{},10->{8,9} ,11->{7,10},12->{6,11},13->{5,12},14->{4,13},15->{3,14},16->{2,15}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I) -> f17(0,J,K,0,E,F,G,H,I) True (1,1) 1. f17(A,B,C,D,E,F,G,H,I) -> f17(A,B,C,1 + D,E,F,G,H,I) [49 >= D] (?,1) 2. f27(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,1 + E,F,G,H,I) [49 >= E] (?,1) 3. f37(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,1 + F,G,H,I) [49 >= F] (?,1) 4. f45(A,B,C,D,E,F,G,H,I) -> f45(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 5. f55(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,1 + G,H,I) [49 >= G] (?,1) 6. f65(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,1 + H,I) [49 >= H] (?,1) 7. f75(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,1 + I) [49 >= I] (?,1) 8. f83(A,B,C,D,E,F,G,H,I) -> f83(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 9. f83(A,B,C,D,E,F,G,H,I) -> f93(A,B,C,D,E,F,G,H,I) [A >= 50] (1,1) 10. f75(A,B,C,D,E,F,G,H,I) -> f83(0,B,C,D,E,F,G,H,I) [I >= 50] (1,1) 11. f65(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,0) [H >= 50] (1,1) 12. f55(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,0,I) [G >= 50] (1,1) 13. f45(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,0,H,I) [A >= 50] (1,1) 14. f37(A,B,C,D,E,F,G,H,I) -> f45(0,B,C,D,E,F,G,H,I) [F >= 50] (1,1) 15. f27(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,0,G,H,I) [E >= 50] (1,1) 16. f17(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,0,F,G,H,I) [D >= 50] (1,1) Signature: {(f0,9);(f17,9);(f27,9);(f37,9);(f45,9);(f55,9);(f65,9);(f75,9);(f83,9);(f93,9)} Flow Graph: [0->{1,16},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9},9->{},10->{8,9} ,11->{7,10},12->{6,11},13->{5,12},14->{4,13},15->{3,14},16->{2,15}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,16) ,(10,9) ,(11,10) ,(12,11) ,(13,12) ,(14,13) ,(15,14) ,(16,15)] * Step 3: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I) -> f17(0,J,K,0,E,F,G,H,I) True (1,1) 1. f17(A,B,C,D,E,F,G,H,I) -> f17(A,B,C,1 + D,E,F,G,H,I) [49 >= D] (?,1) 2. f27(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,1 + E,F,G,H,I) [49 >= E] (?,1) 3. f37(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,1 + F,G,H,I) [49 >= F] (?,1) 4. f45(A,B,C,D,E,F,G,H,I) -> f45(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 5. f55(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,1 + G,H,I) [49 >= G] (?,1) 6. f65(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,1 + H,I) [49 >= H] (?,1) 7. f75(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,1 + I) [49 >= I] (?,1) 8. f83(A,B,C,D,E,F,G,H,I) -> f83(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 9. f83(A,B,C,D,E,F,G,H,I) -> f93(A,B,C,D,E,F,G,H,I) [A >= 50] (1,1) 10. f75(A,B,C,D,E,F,G,H,I) -> f83(0,B,C,D,E,F,G,H,I) [I >= 50] (1,1) 11. f65(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,0) [H >= 50] (1,1) 12. f55(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,0,I) [G >= 50] (1,1) 13. f45(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,0,H,I) [A >= 50] (1,1) 14. f37(A,B,C,D,E,F,G,H,I) -> f45(0,B,C,D,E,F,G,H,I) [F >= 50] (1,1) 15. f27(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,0,G,H,I) [E >= 50] (1,1) 16. f17(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,0,F,G,H,I) [D >= 50] (1,1) Signature: {(f0,9);(f17,9);(f27,9);(f37,9);(f45,9);(f55,9);(f65,9);(f75,9);(f83,9);(f93,9)} Flow Graph: [0->{1},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9},9->{},10->{8} ,11->{7},12->{6},13->{5},14->{4},15->{3},16->{2}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I) -> f17(0,J,K,0,E,F,G,H,I) True (1,1) 1. f17(A,B,C,D,E,F,G,H,I) -> f17(A,B,C,1 + D,E,F,G,H,I) [49 >= D] (?,1) 2. f27(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,1 + E,F,G,H,I) [49 >= E] (?,1) 3. f37(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,1 + F,G,H,I) [49 >= F] (?,1) 4. f45(A,B,C,D,E,F,G,H,I) -> f45(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 5. f55(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,1 + G,H,I) [49 >= G] (?,1) 6. f65(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,1 + H,I) [49 >= H] (?,1) 7. f75(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,1 + I) [49 >= I] (?,1) 8. f83(A,B,C,D,E,F,G,H,I) -> f83(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 9. f83(A,B,C,D,E,F,G,H,I) -> f93(A,B,C,D,E,F,G,H,I) [A >= 50] (?,1) 10. f75(A,B,C,D,E,F,G,H,I) -> f83(0,B,C,D,E,F,G,H,I) [I >= 50] (?,1) 11. f65(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,0) [H >= 50] (?,1) 12. f55(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,0,I) [G >= 50] (?,1) 13. f45(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,0,H,I) [A >= 50] (?,1) 14. f37(A,B,C,D,E,F,G,H,I) -> f45(0,B,C,D,E,F,G,H,I) [F >= 50] (?,1) 15. f27(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,0,G,H,I) [E >= 50] (?,1) 16. f17(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,0,F,G,H,I) [D >= 50] (?,1) 17. f83(A,B,C,D,E,F,G,H,I) -> exitus616(A,B,C,D,E,F,G,H,I) True (?,1) Signature: {(exitus616,9);(f0,9);(f17,9);(f27,9);(f37,9);(f45,9);(f55,9);(f65,9);(f75,9);(f83,9);(f93,9)} Flow Graph: [0->{1,16},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9,17},9->{},10->{8 ,9,17},11->{7,10},12->{6,11},13->{5,12},14->{4,13},15->{3,14},16->{2,15},17->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,16) ,(10,9) ,(11,10) ,(12,11) ,(13,12) ,(14,13) ,(15,14) ,(16,15)] * Step 5: LooptreeTransformer WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I) -> f17(0,J,K,0,E,F,G,H,I) True (1,1) 1. f17(A,B,C,D,E,F,G,H,I) -> f17(A,B,C,1 + D,E,F,G,H,I) [49 >= D] (?,1) 2. f27(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,1 + E,F,G,H,I) [49 >= E] (?,1) 3. f37(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,1 + F,G,H,I) [49 >= F] (?,1) 4. f45(A,B,C,D,E,F,G,H,I) -> f45(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 5. f55(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,1 + G,H,I) [49 >= G] (?,1) 6. f65(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,1 + H,I) [49 >= H] (?,1) 7. f75(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,1 + I) [49 >= I] (?,1) 8. f83(A,B,C,D,E,F,G,H,I) -> f83(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 9. f83(A,B,C,D,E,F,G,H,I) -> f93(A,B,C,D,E,F,G,H,I) [A >= 50] (?,1) 10. f75(A,B,C,D,E,F,G,H,I) -> f83(0,B,C,D,E,F,G,H,I) [I >= 50] (?,1) 11. f65(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,0) [H >= 50] (?,1) 12. f55(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,0,I) [G >= 50] (?,1) 13. f45(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,0,H,I) [A >= 50] (?,1) 14. f37(A,B,C,D,E,F,G,H,I) -> f45(0,B,C,D,E,F,G,H,I) [F >= 50] (?,1) 15. f27(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,0,G,H,I) [E >= 50] (?,1) 16. f17(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,0,F,G,H,I) [D >= 50] (?,1) 17. f83(A,B,C,D,E,F,G,H,I) -> exitus616(A,B,C,D,E,F,G,H,I) True (?,1) Signature: {(exitus616,9);(f0,9);(f17,9);(f27,9);(f37,9);(f45,9);(f55,9);(f65,9);(f75,9);(f83,9);(f93,9)} Flow Graph: [0->{1},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9,17},9->{},10->{8,17} ,11->{7},12->{6},13->{5},14->{4},15->{3},16->{2},17->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17] | +- p:[1] c: [1] | +- p:[2] c: [2] | +- p:[3] c: [3] | +- p:[4] c: [4] | +- p:[5] c: [5] | +- p:[6] c: [6] | +- p:[7] c: [7] | `- p:[8] c: [8] * Step 6: SizeAbstraction WORST_CASE(?,O(1)) + Considered Problem: (Rules: 0. f0(A,B,C,D,E,F,G,H,I) -> f17(0,J,K,0,E,F,G,H,I) True (1,1) 1. f17(A,B,C,D,E,F,G,H,I) -> f17(A,B,C,1 + D,E,F,G,H,I) [49 >= D] (?,1) 2. f27(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,1 + E,F,G,H,I) [49 >= E] (?,1) 3. f37(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,1 + F,G,H,I) [49 >= F] (?,1) 4. f45(A,B,C,D,E,F,G,H,I) -> f45(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 5. f55(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,1 + G,H,I) [49 >= G] (?,1) 6. f65(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,1 + H,I) [49 >= H] (?,1) 7. f75(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,1 + I) [49 >= I] (?,1) 8. f83(A,B,C,D,E,F,G,H,I) -> f83(1 + A,B,C,D,E,F,G,H,I) [49 >= A] (?,1) 9. f83(A,B,C,D,E,F,G,H,I) -> f93(A,B,C,D,E,F,G,H,I) [A >= 50] (?,1) 10. f75(A,B,C,D,E,F,G,H,I) -> f83(0,B,C,D,E,F,G,H,I) [I >= 50] (?,1) 11. f65(A,B,C,D,E,F,G,H,I) -> f75(A,B,C,D,E,F,G,H,0) [H >= 50] (?,1) 12. f55(A,B,C,D,E,F,G,H,I) -> f65(A,B,C,D,E,F,G,0,I) [G >= 50] (?,1) 13. f45(A,B,C,D,E,F,G,H,I) -> f55(A,B,C,D,E,F,0,H,I) [A >= 50] (?,1) 14. f37(A,B,C,D,E,F,G,H,I) -> f45(0,B,C,D,E,F,G,H,I) [F >= 50] (?,1) 15. f27(A,B,C,D,E,F,G,H,I) -> f37(A,B,C,D,E,0,G,H,I) [E >= 50] (?,1) 16. f17(A,B,C,D,E,F,G,H,I) -> f27(A,B,C,D,0,F,G,H,I) [D >= 50] (?,1) 17. f83(A,B,C,D,E,F,G,H,I) -> exitus616(A,B,C,D,E,F,G,H,I) True (?,1) Signature: {(exitus616,9);(f0,9);(f17,9);(f27,9);(f37,9);(f45,9);(f55,9);(f65,9);(f75,9);(f83,9);(f93,9)} Flow Graph: [0->{1},1->{1,16},2->{2,15},3->{3,14},4->{4,13},5->{5,12},6->{6,11},7->{7,10},8->{8,9,17},9->{},10->{8,17} ,11->{7},12->{6},13->{5},14->{4},15->{3},16->{2},17->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17] | +- p:[1] c: [1] | +- p:[2] c: [2] | +- p:[3] c: [3] | +- p:[4] c: [4] | +- p:[5] c: [5] | +- p:[6] c: [6] | +- p:[7] c: [7] | `- p:[8] c: [8]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,0.0,0.1,0.2,0.3,0.4,0.5,0.6,0.7] f0 ~> f17 [A <= 0*K, B <= unknown, C <= unknown, D <= 0*K, E <= E, F <= F, G <= G, H <= H, I <= I] f17 ~> f17 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= G, H <= H, I <= I] f27 ~> f27 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= F, G <= G, H <= H, I <= I] f37 ~> f37 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I] f45 ~> f45 [A <= K + A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] f55 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= K + G, H <= H, I <= I] f65 ~> f65 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= K + H, I <= I] f75 ~> f75 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= K + I] f83 ~> f83 [A <= K + A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] f83 ~> f93 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] f75 ~> f83 [A <= 0*K, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] f65 ~> f75 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= 0*K] f55 ~> f65 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= 0*K, I <= I] f45 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 0*K, H <= H, I <= I] f37 ~> f45 [A <= 0*K, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] f27 ~> f37 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= 0*K, G <= G, H <= H, I <= I] f17 ~> f27 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= G, H <= H, I <= I] f83 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] + Loop: [0.0 <= 50*K + D] f17 ~> f17 [A <= A, B <= B, C <= C, D <= K + D, E <= E, F <= F, G <= G, H <= H, I <= I] + Loop: [0.1 <= 50*K + E] f27 ~> f27 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= F, G <= G, H <= H, I <= I] + Loop: [0.2 <= 50*K + F] f37 ~> f37 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H, I <= I] + Loop: [0.3 <= 50*K + A] f45 ~> f45 [A <= K + A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] + Loop: [0.4 <= 50*K + G] f55 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= K + G, H <= H, I <= I] + Loop: [0.5 <= 50*K + H] f65 ~> f65 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= K + H, I <= I] + Loop: [0.6 <= 50*K + I] f75 ~> f75 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= K + I] + Loop: [0.7 <= 50*K + A] f83 ~> f83 [A <= K + A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,0.0,0.1,0.2,0.3,0.4,0.5,0.6,0.7] f0 ~> f17 [K ~=> A,K ~=> D,huge ~=> B,huge ~=> C] f17 ~> f17 [D ~+> D,K ~+> D] f27 ~> f27 [E ~+> E,K ~+> E] f37 ~> f37 [F ~+> F,K ~+> F] f45 ~> f45 [A ~+> A,K ~+> A] f55 ~> f55 [G ~+> G,K ~+> G] f65 ~> f65 [H ~+> H,K ~+> H] f75 ~> f75 [I ~+> I,K ~+> I] f83 ~> f83 [A ~+> A,K ~+> A] f83 ~> f93 [] f75 ~> f83 [K ~=> A] f65 ~> f75 [K ~=> I] f55 ~> f65 [K ~=> H] f45 ~> f55 [K ~=> G] f37 ~> f45 [K ~=> A] f27 ~> f37 [K ~=> F] f17 ~> f27 [K ~=> E] f83 ~> exitus616 [] + Loop: [D ~+> 0.0,K ~*> 0.0] f17 ~> f17 [D ~+> D,K ~+> D] + Loop: [E ~+> 0.1,K ~*> 0.1] f27 ~> f27 [E ~+> E,K ~+> E] + Loop: [F ~+> 0.2,K ~*> 0.2] f37 ~> f37 [F ~+> F,K ~+> F] + Loop: [A ~+> 0.3,K ~*> 0.3] f45 ~> f45 [A ~+> A,K ~+> A] + Loop: [G ~+> 0.4,K ~*> 0.4] f55 ~> f55 [G ~+> G,K ~+> G] + Loop: [H ~+> 0.5,K ~*> 0.5] f65 ~> f65 [H ~+> H,K ~+> H] + Loop: [I ~+> 0.6,K ~*> 0.6] f75 ~> f75 [I ~+> I,K ~+> I] + Loop: [A ~+> 0.7,K ~*> 0.7] f83 ~> f83 [A ~+> A,K ~+> A] + Applied Processor: LareProcessor + Details: f0 ~> f93 [K ~=> A ,K ~=> D ,K ~=> E ,K ~=> F ,K ~=> G ,K ~=> H ,K ~=> I ,huge ~=> B ,huge ~=> C ,tick ~+> tick ,K ~+> A ,K ~+> D ,K ~+> E ,K ~+> F ,K ~+> G ,K ~+> H ,K ~+> I ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.2 ,K ~+> 0.3 ,K ~+> 0.4 ,K ~+> 0.5 ,K ~+> 0.6 ,K ~+> 0.7 ,K ~+> tick ,K ~*> A ,K ~*> D ,K ~*> E ,K ~*> F ,K ~*> G ,K ~*> H ,K ~*> I ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.2 ,K ~*> 0.3 ,K ~*> 0.4 ,K ~*> 0.5 ,K ~*> 0.6 ,K ~*> 0.7 ,K ~*> tick] f0 ~> exitus616 [K ~=> A ,K ~=> D ,K ~=> E ,K ~=> F ,K ~=> G ,K ~=> H ,K ~=> I ,huge ~=> B ,huge ~=> C ,tick ~+> tick ,K ~+> A ,K ~+> D ,K ~+> E ,K ~+> F ,K ~+> G ,K ~+> H ,K ~+> I ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.2 ,K ~+> 0.3 ,K ~+> 0.4 ,K ~+> 0.5 ,K ~+> 0.6 ,K ~+> 0.7 ,K ~+> tick ,K ~*> A ,K ~*> D ,K ~*> E ,K ~*> F ,K ~*> G ,K ~*> H ,K ~*> I ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.2 ,K ~*> 0.3 ,K ~*> 0.4 ,K ~*> 0.5 ,K ~*> 0.6 ,K ~*> 0.7 ,K ~*> tick] + f17> [D ~+> D,D ~+> 0.0,D ~+> tick,tick ~+> tick,K ~+> D,D ~*> D,K ~*> D,K ~*> 0.0,K ~*> tick] + f27> [E ~+> E,E ~+> 0.1,E ~+> tick,tick ~+> tick,K ~+> E,E ~*> E,K ~*> E,K ~*> 0.1,K ~*> tick] + f37> [F ~+> F,F ~+> 0.2,F ~+> tick,tick ~+> tick,K ~+> F,F ~*> F,K ~*> F,K ~*> 0.2,K ~*> tick] + f45> [A ~+> A,A ~+> 0.3,A ~+> tick,tick ~+> tick,K ~+> A,A ~*> A,K ~*> A,K ~*> 0.3,K ~*> tick] + f55> [G ~+> G,G ~+> 0.4,G ~+> tick,tick ~+> tick,K ~+> G,G ~*> G,K ~*> G,K ~*> 0.4,K ~*> tick] + f65> [H ~+> H,H ~+> 0.5,H ~+> tick,tick ~+> tick,K ~+> H,H ~*> H,K ~*> H,K ~*> 0.5,K ~*> tick] + f75> [I ~+> I,I ~+> 0.6,I ~+> tick,tick ~+> tick,K ~+> I,I ~*> I,K ~*> I,K ~*> 0.6,K ~*> tick] + f83> [A ~+> A,A ~+> 0.7,A ~+> tick,tick ~+> tick,K ~+> A,A ~*> A,K ~*> A,K ~*> 0.7,K ~*> tick] YES(?,O(1))