MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (?,1) Signature: {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1,8},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (1,1) Signature: {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1,8},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,8)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (1,1) Signature: {(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1},1->{2,5,6,7},2->{2,5,6,7},3->{1,8},4->{1,8},5->{3,4},6->{3,4},7->{1,8},8->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (?,1) 9. f15(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1,8,9},1->{2,5,6,7},2->{2,5,6,7},3->{1,8,9},4->{1,8,9},5->{3,4},6->{3,4},7->{1,8,9},8->{},9->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,8)] * Step 5: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (?,1) 9. f15(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1,9},1->{2,5,6,7},2->{2,5,6,7},3->{1,8,9},4->{1,8,9},5->{3,4},6->{3,4},7->{1,8,9},8->{},9->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[1,3,5,2,6,4,7] c: [1] | `- p:[2] c: [2] * Step 6: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. f0(A,B,C,D,E,F,G,H) -> f15(10,35,285,I,I,0,G,H) True (1,1) 1. f15(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1) [A >= 1 + F] (?,1) 2. f25(A,B,C,D,E,F,G,H) -> f25(A,B,C,D,E,F,I,1 + H) [E >= 1 + H] (?,1) 3. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,E,1 + F,G,H) [E >= B] (?,1) 4. f41(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,1 + E,1 + F,G,H) [B >= 1 + E] (?,1) 5. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E && I >= 1 + J] (?,1) 6. f25(A,B,C,D,E,F,G,H) -> f41(A,B,C,D,E,F,G,H) [H >= E] (?,1) 7. f25(A,B,C,D,E,F,G,H) -> f15(A,B,C,D,-1 + E,1 + F,G,H) [H >= E] (?,1) 8. f15(A,B,C,D,E,F,G,H) -> f48(A,B,C,D,E,F,G,H) [F >= A] (?,1) 9. f15(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H) True (?,1) Signature: {(exitus616,8);(f0,8);(f15,8);(f25,8);(f41,8);(f48,8)} Flow Graph: [0->{1,9},1->{2,5,6,7},2->{2,5,6,7},3->{1,8,9},4->{1,8,9},5->{3,4},6->{3,4},7->{1,8,9},8->{},9->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[1,3,5,2,6,4,7] c: [1] | `- p:[2] c: [2]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,0.0,0.0.0] f0 ~> f15 [A <= 10*K, B <= 35*K, C <= 285*K, D <= unknown, E <= unknown, F <= 0*K, G <= G, H <= H] f15 ~> f25 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f25 ~> f25 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f41 ~> f15 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H] f41 ~> f15 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= K + F, G <= G, H <= H] f25 ~> f41 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25 ~> f41 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25 ~> f15 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= K + F, G <= G, H <= H] f15 ~> f48 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f15 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] + Loop: [0.0 <= 2*K + A + F] f15 ~> f25 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= K] f41 ~> f15 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= K + F, G <= G, H <= H] f25 ~> f41 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f25 ~> f25 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] f25 ~> f41 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H] f41 ~> f15 [A <= A, B <= B, C <= C, D <= D, E <= B + E, F <= K + F, G <= G, H <= H] f25 ~> f15 [A <= A, B <= B, C <= C, D <= D, E <= K + E, F <= K + F, G <= G, H <= H] + Loop: [0.0.0 <= E + H] f25 ~> f25 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= unknown, H <= E + H] + Applied Processor: FlowAbstraction + Details: () * Step 8: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,0.0,0.0.0] f0 ~> f15 [K ~=> A,K ~=> B,K ~=> C,K ~=> F,huge ~=> D,huge ~=> E] f15 ~> f25 [K ~=> H,huge ~=> G] f25 ~> f25 [huge ~=> G,E ~+> H,H ~+> H] f41 ~> f15 [F ~+> F,K ~+> F] f41 ~> f15 [B ~+> E,E ~+> E,F ~+> F,K ~+> F] f25 ~> f41 [] f25 ~> f41 [] f25 ~> f15 [E ~+> E,F ~+> F,K ~+> E,K ~+> F] f15 ~> f48 [] f15 ~> exitus616 [] + Loop: [A ~+> 0.0,F ~+> 0.0,K ~*> 0.0] f15 ~> f25 [K ~=> H,huge ~=> G] f41 ~> f15 [F ~+> F,K ~+> F] f25 ~> f41 [] f25 ~> f25 [huge ~=> G,E ~+> H,H ~+> H] f25 ~> f41 [] f41 ~> f15 [B ~+> E,E ~+> E,F ~+> F,K ~+> F] f25 ~> f15 [E ~+> E,F ~+> F,K ~+> E,K ~+> F] + Loop: [E ~+> 0.0.0,H ~+> 0.0.0] f25 ~> f25 [huge ~=> G,E ~+> H,H ~+> H] + Applied Processor: LareProcessor + Details: Unknown bound. MAYBE