MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True (1,1) 1. evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] (?,1) 3. evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] (?,1) 4. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] (?,1) 5. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] (?,1) 6. evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True (?,1) 7. evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] (?,1) 8. evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] (?,1) 9. evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True (?,1) 10. evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True (?,1) 11. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True (?,1) Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4)} Flow Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True (1,1) 1. evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] (1,1) 2. evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] (1,1) 3. evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] (?,1) 4. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] (?,1) 5. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] (?,1) 6. evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True (1,1) 7. evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] (?,1) 8. evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] (?,1) 9. evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True (?,1) 10. evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True (?,1) 11. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True (1,1) Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4)} Flow Graph: [0->{1},1->{2,3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True (1,1) 1. evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] (1,1) 2. evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] (1,1) 3. evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] (?,1) 4. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] (?,1) 5. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] (?,1) 6. evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True (1,1) 7. evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] (?,1) 8. evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] (?,1) 9. evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True (?,1) 10. evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True (?,1) 11. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True (1,1) Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4)} Flow Graph: [0->{1},1->{3},2->{11},3->{4,5,6},4->{7,8},5->{7,8},6->{11},7->{9},8->{10},9->{2,3},10->{2,3},11->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True (1,1) 1. evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] (?,1) 3. evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] (?,1) 4. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] (?,1) 5. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] (?,1) 6. evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True (?,1) 7. evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] (?,1) 8. evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] (?,1) 9. evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True (?,1) 10. evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True (?,1) 11. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True (?,1) 12. evalfreturnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{2,3},2->{11,12},3->{4,5,6},4->{7,8},5->{7,8},6->{11,12},7->{9},8->{10},9->{2,3},10->{2,3} ,11->{},12->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. evalfstart(A,B,C,D) -> evalfentryin(A,B,C,D) True (1,1) 1. evalfentryin(A,B,C,D) -> evalfbb3in(A,B,0,0) [A >= 1 && B >= 1 + A] (?,1) 2. evalfbb3in(A,B,C,D) -> evalfreturnin(A,B,C,D) [D >= B] (?,1) 3. evalfbb3in(A,B,C,D) -> evalfbb4in(A,B,C,D) [B >= 1 + D] (?,1) 4. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [0 >= 1 + E] (?,1) 5. evalfbb4in(A,B,C,D) -> evalfbbin(A,B,C,D) [E >= 1] (?,1) 6. evalfbb4in(A,B,C,D) -> evalfreturnin(A,B,C,D) True (?,1) 7. evalfbbin(A,B,C,D) -> evalfbb1in(A,B,C,D) [A >= 1 + C] (?,1) 8. evalfbbin(A,B,C,D) -> evalfbb2in(A,B,C,D) [C >= A] (?,1) 9. evalfbb1in(A,B,C,D) -> evalfbb3in(A,B,1 + C,D) True (?,1) 10. evalfbb2in(A,B,C,D) -> evalfbb3in(A,B,0,1 + D) True (?,1) 11. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D) True (?,1) 12. evalfreturnin(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(evalfbb1in,4) ;(evalfbb2in,4) ;(evalfbb3in,4) ;(evalfbb4in,4) ;(evalfbbin,4) ;(evalfentryin,4) ;(evalfreturnin,4) ;(evalfstart,4) ;(evalfstop,4) ;(exitus616,4)} Flow Graph: [0->{1},1->{3},2->{11,12},3->{4,5,6},4->{7,8},5->{7,8},6->{11,12},7->{9},8->{10},9->{2,3},10->{2,3},11->{} ,12->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12] | `- p:[3,9,7,4,5,10,8] c: [] MAYBE