MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (?,1) Signature: {(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{1,2,3,4,5},4->{1,2,3,4,5},5->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,5),(3,3),(3,4),(3,5),(4,3),(4,4),(4,5)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (?,1) Signature: {(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{1,2},4->{1,2},5->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: f0(A,B,C,D,E) -> f1(F,1,0,D,E) True f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] Signature: {(f0,5);(f1,5);(f2,5)} Rule Graph: [0->{1,2,3,4},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{1,2},4->{1,2},5->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E) -> f1.1(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.2(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.3(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.4(F,1,0,D,E) True f1.1(A,B,C,D,E) -> f1.1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.2(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.3(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.4(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.5(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.2(A,B,C,D,E) -> f1.1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.2(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.3(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.4(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.5(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.3(A,B,C,D,E) -> f1.1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] f1.3(A,B,C,D,E) -> f1.2(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] f1.4(A,B,C,D,E) -> f1.1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] f1.4(A,B,C,D,E) -> f1.2(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] f1.5(A,B,C,D,E) -> f2.6(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] Signature: {(f0.0,5);(f1.1,5);(f1.2,5);(f1.3,5);(f1.4,5);(f1.5,5);(f2.6,5)} Rule Graph: [0->{4,5,6,7,8},1->{9,10,11,12,13},2->{14,15},3->{16,17},4->{4,5,6,7,8},5->{9,10,11,12,13},6->{14,15} ,7->{16,17},8->{18},9->{4,5,6,7,8},10->{9,10,11,12,13},11->{14,15},12->{16,17},13->{18},14->{4,5,6,7,8} ,15->{9,10,11,12,13},16->{4,5,6,7,8},17->{9,10,11,12,13},18->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E) -> f1.1(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.2(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.3(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.4(F,1,0,D,E) True f1.1(A,B,C,D,E) -> f1.1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.2(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.3(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.4(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.5(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.2(A,B,C,D,E) -> f1.1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.2(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.3(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.4(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.5(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.3(A,B,C,D,E) -> f1.1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] f1.3(A,B,C,D,E) -> f1.2(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] f1.4(A,B,C,D,E) -> f1.1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] f1.4(A,B,C,D,E) -> f1.2(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] f1.5(A,B,C,D,E) -> f2.6(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(exitus616,5);(f0.0,5);(f1.1,5);(f1.2,5);(f1.3,5);(f1.4,5);(f1.5,5);(f2.6,5)} Rule Graph: [0->{4,5,6,7,8},1->{9,10,11,12,13},2->{14,15},3->{16,17},4->{4,5,6,7,8},5->{9,10,11,12,13},6->{14,15} ,7->{16,17},8->{18},9->{4,5,6,7,8},10->{9,10,11,12,13},11->{14,15},12->{16,17},13->{18},14->{4,5,6,7,8} ,15->{9,10,11,12,13},16->{4,5,6,7,8},17->{9,10,11,12,13},18->{19,20,21,22,23,24,25,26}] + 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,26] | `- p:[4,9,5,14,6,16,7,12,10,15,11,17] c: [5,6,7,9,10,11,12,14,15,16,17] | `- p:[4] c: [4] * Step 6: AbstractSize MAYBE + Considered Problem: (Rules: f0.0(A,B,C,D,E) -> f1.1(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.2(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.3(F,1,0,D,E) True f0.0(A,B,C,D,E) -> f1.4(F,1,0,D,E) True f1.1(A,B,C,D,E) -> f1.1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.2(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.3(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.4(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.1(A,B,C,D,E) -> f1.5(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] f1.2(A,B,C,D,E) -> f1.1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.2(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.3(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.4(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.2(A,B,C,D,E) -> f1.5(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] f1.3(A,B,C,D,E) -> f1.1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] f1.3(A,B,C,D,E) -> f1.2(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] f1.4(A,B,C,D,E) -> f1.1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] f1.4(A,B,C,D,E) -> f1.2(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] f1.5(A,B,C,D,E) -> f2.6(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True f2.6(A,B,C,D,E) -> exitus616(A,B,C,D,E) True Signature: {(exitus616,5);(f0.0,5);(f1.1,5);(f1.2,5);(f1.3,5);(f1.4,5);(f1.5,5);(f2.6,5)} Rule Graph: [0->{4,5,6,7,8},1->{9,10,11,12,13},2->{14,15},3->{16,17},4->{4,5,6,7,8},5->{9,10,11,12,13},6->{14,15} ,7->{16,17},8->{18},9->{4,5,6,7,8},10->{9,10,11,12,13},11->{14,15},12->{16,17},13->{18},14->{4,5,6,7,8} ,15->{9,10,11,12,13},16->{4,5,6,7,8},17->{9,10,11,12,13},18->{19,20,21,22,23,24,25,26}] ,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,26] | `- p:[4,9,5,14,6,16,7,12,10,15,11,17] c: [5,6,7,9,10,11,12,14,15,16,17] | `- p:[4] c: [4]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0] f0.0 ~> f1.1 [A <= unknown, B <= K, C <= 0*K, D <= D, E <= E] f0.0 ~> f1.2 [A <= unknown, B <= K, C <= 0*K, D <= D, E <= E] f0.0 ~> f1.3 [A <= unknown, B <= K, C <= 0*K, D <= D, E <= E] f0.0 ~> f1.4 [A <= unknown, B <= K, C <= 0*K, D <= D, E <= E] f1.1 ~> f1.1 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.1 ~> f1.2 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.1 ~> f1.3 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.1 ~> f1.4 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.1 ~> f1.5 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.2 ~> f1.1 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.2 ~> f1.2 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.2 ~> f1.3 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.2 ~> f1.4 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.2 ~> f1.5 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.3 ~> f1.1 [A <= A, B <= B, C <= K, D <= A, E <= B] f1.3 ~> f1.2 [A <= A, B <= B, C <= K, D <= A, E <= B] f1.4 ~> f1.1 [A <= 11*K + A, B <= K + B, C <= K, D <= A, E <= B] f1.4 ~> f1.2 [A <= 11*K + A, B <= K + B, C <= K, D <= A, E <= B] f1.5 ~> f2.6 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] f2.6 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= 90*K + A + 10*B + C] f1.1 ~> f1.1 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.2 ~> f1.1 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.1 ~> f1.2 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.3 ~> f1.1 [A <= A, B <= B, C <= K, D <= A, E <= B] f1.1 ~> f1.3 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.4 ~> f1.1 [A <= 11*K + A, B <= K + B, C <= K, D <= A, E <= B] f1.1 ~> f1.4 [A <= A, B <= B, C <= C, D <= D, E <= E] f1.2 ~> f1.4 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.2 ~> f1.2 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.3 ~> f1.2 [A <= A, B <= B, C <= K, D <= A, E <= B] f1.2 ~> f1.3 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1.4 ~> f1.2 [A <= 11*K + A, B <= K + B, C <= K, D <= A, E <= B] + Loop: [0.0.0 <= K + B] f1.1 ~> f1.1 [A <= A, B <= B, C <= C, D <= D, E <= E] + Applied Processor: AbstractFlow + Details: () * Step 8: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0] f0.0 ~> f1.1 [K ~=> B,K ~=> C,huge ~=> A] f0.0 ~> f1.2 [K ~=> B,K ~=> C,huge ~=> A] f0.0 ~> f1.3 [K ~=> B,K ~=> C,huge ~=> A] f0.0 ~> f1.4 [K ~=> B,K ~=> C,huge ~=> A] f1.1 ~> f1.1 [] f1.1 ~> f1.2 [] f1.1 ~> f1.3 [] f1.1 ~> f1.4 [] f1.1 ~> f1.5 [] f1.2 ~> f1.1 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.2 ~> f1.2 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.2 ~> f1.3 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.2 ~> f1.4 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.2 ~> f1.5 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.3 ~> f1.1 [A ~=> D,B ~=> E,K ~=> C] f1.3 ~> f1.2 [A ~=> D,B ~=> E,K ~=> C] f1.4 ~> f1.1 [A ~=> D,B ~=> E,K ~=> C,A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.4 ~> f1.2 [A ~=> D,B ~=> E,K ~=> C,A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.5 ~> f2.6 [] f2.6 ~> exitus616 [] f2.6 ~> exitus616 [] f2.6 ~> exitus616 [] f2.6 ~> exitus616 [] f2.6 ~> exitus616 [] f2.6 ~> exitus616 [] f2.6 ~> exitus616 [] f2.6 ~> exitus616 [] + Loop: [A ~+> 0.0,C ~+> 0.0,B ~*> 0.0,K ~*> 0.0] f1.1 ~> f1.1 [] f1.2 ~> f1.1 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.1 ~> f1.2 [] f1.3 ~> f1.1 [A ~=> D,B ~=> E,K ~=> C] f1.1 ~> f1.3 [] f1.4 ~> f1.1 [A ~=> D,B ~=> E,K ~=> C,A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.1 ~> f1.4 [] f1.2 ~> f1.4 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.2 ~> f1.2 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.3 ~> f1.2 [A ~=> D,B ~=> E,K ~=> C] f1.2 ~> f1.3 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1.4 ~> f1.2 [A ~=> D,B ~=> E,K ~=> C,A ~+> A,B ~+> B,K ~+> B,K ~*> A] + Loop: [B ~+> 0.0.0,K ~+> 0.0.0] f1.1 ~> f1.1 [] + Applied Processor: Lare + Details: Unknown bound. MAYBE