MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalspeedpldi4start(A,B) -> evalspeedpldi4entryin(A,B) True (1,1) 1. evalspeedpldi4entryin(A,B) -> evalspeedpldi4returnin(A,B) [0 >= A] (?,1) 2. evalspeedpldi4entryin(A,B) -> evalspeedpldi4returnin(A,B) [A >= B] (?,1) 3. evalspeedpldi4entryin(A,B) -> evalspeedpldi4bb5in(A,B) [A >= 1 && B >= 1 + A] (?,1) 4. evalspeedpldi4bb5in(A,B) -> evalspeedpldi4bb2in(A,B) [B >= 1] (?,1) 5. evalspeedpldi4bb5in(A,B) -> evalspeedpldi4returnin(A,B) [0 >= B] (?,1) 6. evalspeedpldi4bb2in(A,B) -> evalspeedpldi4bb3in(A,B) [A >= 1 + B] (?,1) 7. evalspeedpldi4bb2in(A,B) -> evalspeedpldi4bb4in(A,B) [B >= A] (?,1) 8. evalspeedpldi4bb3in(A,B) -> evalspeedpldi4bb5in(A,-1 + B) True (?,1) 9. evalspeedpldi4bb4in(A,B) -> evalspeedpldi4bb5in(A,-1*A + B) True (?,1) 10. evalspeedpldi4returnin(A,B) -> evalspeedpldi4stop(A,B) True (?,1) Signature: {(evalspeedpldi4bb2in,2) ;(evalspeedpldi4bb3in,2) ;(evalspeedpldi4bb4in,2) ;(evalspeedpldi4bb5in,2) ;(evalspeedpldi4entryin,2) ;(evalspeedpldi4returnin,2) ;(evalspeedpldi4start,2) ;(evalspeedpldi4stop,2)} Flow Graph: [0->{1,2,3},1->{10},2->{10},3->{4,5},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(3,5)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. evalspeedpldi4start(A,B) -> evalspeedpldi4entryin(A,B) True (1,1) 1. evalspeedpldi4entryin(A,B) -> evalspeedpldi4returnin(A,B) [0 >= A] (?,1) 2. evalspeedpldi4entryin(A,B) -> evalspeedpldi4returnin(A,B) [A >= B] (?,1) 3. evalspeedpldi4entryin(A,B) -> evalspeedpldi4bb5in(A,B) [A >= 1 && B >= 1 + A] (?,1) 4. evalspeedpldi4bb5in(A,B) -> evalspeedpldi4bb2in(A,B) [B >= 1] (?,1) 5. evalspeedpldi4bb5in(A,B) -> evalspeedpldi4returnin(A,B) [0 >= B] (?,1) 6. evalspeedpldi4bb2in(A,B) -> evalspeedpldi4bb3in(A,B) [A >= 1 + B] (?,1) 7. evalspeedpldi4bb2in(A,B) -> evalspeedpldi4bb4in(A,B) [B >= A] (?,1) 8. evalspeedpldi4bb3in(A,B) -> evalspeedpldi4bb5in(A,-1 + B) True (?,1) 9. evalspeedpldi4bb4in(A,B) -> evalspeedpldi4bb5in(A,-1*A + B) True (?,1) 10. evalspeedpldi4returnin(A,B) -> evalspeedpldi4stop(A,B) True (?,1) Signature: {(evalspeedpldi4bb2in,2) ;(evalspeedpldi4bb3in,2) ;(evalspeedpldi4bb4in,2) ;(evalspeedpldi4bb5in,2) ;(evalspeedpldi4entryin,2) ;(evalspeedpldi4returnin,2) ;(evalspeedpldi4start,2) ;(evalspeedpldi4stop,2)} Flow Graph: [0->{1,2,3},1->{10},2->{10},3->{4},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: evalspeedpldi4start(A,B) -> evalspeedpldi4entryin(A,B) True evalspeedpldi4entryin(A,B) -> evalspeedpldi4returnin(A,B) [0 >= A] evalspeedpldi4entryin(A,B) -> evalspeedpldi4returnin(A,B) [A >= B] evalspeedpldi4entryin(A,B) -> evalspeedpldi4bb5in(A,B) [A >= 1 && B >= 1 + A] evalspeedpldi4bb5in(A,B) -> evalspeedpldi4bb2in(A,B) [B >= 1] evalspeedpldi4bb5in(A,B) -> evalspeedpldi4returnin(A,B) [0 >= B] evalspeedpldi4bb2in(A,B) -> evalspeedpldi4bb3in(A,B) [A >= 1 + B] evalspeedpldi4bb2in(A,B) -> evalspeedpldi4bb4in(A,B) [B >= A] evalspeedpldi4bb3in(A,B) -> evalspeedpldi4bb5in(A,-1 + B) True evalspeedpldi4bb4in(A,B) -> evalspeedpldi4bb5in(A,-1*A + B) True evalspeedpldi4returnin(A,B) -> evalspeedpldi4stop(A,B) True Signature: {(evalspeedpldi4bb2in,2) ;(evalspeedpldi4bb3in,2) ;(evalspeedpldi4bb4in,2) ;(evalspeedpldi4bb5in,2) ;(evalspeedpldi4entryin,2) ;(evalspeedpldi4returnin,2) ;(evalspeedpldi4start,2) ;(evalspeedpldi4stop,2)} Rule Graph: [0->{1,2,3},1->{10},2->{10},3->{4},4->{6,7},5->{10},6->{8},7->{9},8->{4,5},9->{4,5},10->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: evalspeedpldi4start.0(A,B) -> evalspeedpldi4entryin.1(A,B) True evalspeedpldi4start.0(A,B) -> evalspeedpldi4entryin.2(A,B) True evalspeedpldi4start.0(A,B) -> evalspeedpldi4entryin.3(A,B) True evalspeedpldi4entryin.1(A,B) -> evalspeedpldi4returnin.10(A,B) [0 >= A] evalspeedpldi4entryin.2(A,B) -> evalspeedpldi4returnin.10(A,B) [A >= B] evalspeedpldi4entryin.3(A,B) -> evalspeedpldi4bb5in.4(A,B) [A >= 1 && B >= 1 + A] evalspeedpldi4bb5in.4(A,B) -> evalspeedpldi4bb2in.6(A,B) [B >= 1] evalspeedpldi4bb5in.4(A,B) -> evalspeedpldi4bb2in.7(A,B) [B >= 1] evalspeedpldi4bb5in.5(A,B) -> evalspeedpldi4returnin.10(A,B) [0 >= B] evalspeedpldi4bb2in.6(A,B) -> evalspeedpldi4bb3in.8(A,B) [A >= 1 + B] evalspeedpldi4bb2in.7(A,B) -> evalspeedpldi4bb4in.9(A,B) [B >= A] evalspeedpldi4bb3in.8(A,B) -> evalspeedpldi4bb5in.4(A,-1 + B) True evalspeedpldi4bb3in.8(A,B) -> evalspeedpldi4bb5in.5(A,-1 + B) True evalspeedpldi4bb4in.9(A,B) -> evalspeedpldi4bb5in.4(A,-1*A + B) True evalspeedpldi4bb4in.9(A,B) -> evalspeedpldi4bb5in.5(A,-1*A + B) True evalspeedpldi4returnin.10(A,B) -> evalspeedpldi4stop.11(A,B) True Signature: {(evalspeedpldi4bb2in.6,2) ;(evalspeedpldi4bb2in.7,2) ;(evalspeedpldi4bb3in.8,2) ;(evalspeedpldi4bb4in.9,2) ;(evalspeedpldi4bb5in.4,2) ;(evalspeedpldi4bb5in.5,2) ;(evalspeedpldi4entryin.1,2) ;(evalspeedpldi4entryin.2,2) ;(evalspeedpldi4entryin.3,2) ;(evalspeedpldi4returnin.10,2) ;(evalspeedpldi4start.0,2) ;(evalspeedpldi4stop.11,2)} Rule Graph: [0->{3},1->{4},2->{5},3->{15},4->{15},5->{6,7},6->{9},7->{10},8->{15},9->{11,12},10->{13,14},11->{6,7} ,12->{8},13->{6,7},14->{8},15->{}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: evalspeedpldi4start.0(A,B) -> evalspeedpldi4entryin.1(A,B) True evalspeedpldi4start.0(A,B) -> evalspeedpldi4entryin.2(A,B) True evalspeedpldi4start.0(A,B) -> evalspeedpldi4entryin.3(A,B) True evalspeedpldi4entryin.1(A,B) -> evalspeedpldi4returnin.10(A,B) [0 >= A] evalspeedpldi4entryin.2(A,B) -> evalspeedpldi4returnin.10(A,B) [A >= B] evalspeedpldi4entryin.3(A,B) -> evalspeedpldi4bb5in.4(A,B) [A >= 1 && B >= 1 + A] evalspeedpldi4bb5in.4(A,B) -> evalspeedpldi4bb2in.6(A,B) [B >= 1] evalspeedpldi4bb5in.4(A,B) -> evalspeedpldi4bb2in.7(A,B) [B >= 1] evalspeedpldi4bb5in.5(A,B) -> evalspeedpldi4returnin.10(A,B) [0 >= B] evalspeedpldi4bb2in.6(A,B) -> evalspeedpldi4bb3in.8(A,B) [A >= 1 + B] evalspeedpldi4bb2in.7(A,B) -> evalspeedpldi4bb4in.9(A,B) [B >= A] evalspeedpldi4bb3in.8(A,B) -> evalspeedpldi4bb5in.4(A,-1 + B) True evalspeedpldi4bb3in.8(A,B) -> evalspeedpldi4bb5in.5(A,-1 + B) True evalspeedpldi4bb4in.9(A,B) -> evalspeedpldi4bb5in.4(A,-1*A + B) True evalspeedpldi4bb4in.9(A,B) -> evalspeedpldi4bb5in.5(A,-1*A + B) True evalspeedpldi4returnin.10(A,B) -> evalspeedpldi4stop.11(A,B) True evalspeedpldi4stop.11(A,B) -> exitus616(A,B) True evalspeedpldi4stop.11(A,B) -> exitus616(A,B) True evalspeedpldi4stop.11(A,B) -> exitus616(A,B) True evalspeedpldi4stop.11(A,B) -> exitus616(A,B) True Signature: {(evalspeedpldi4bb2in.6,2) ;(evalspeedpldi4bb2in.7,2) ;(evalspeedpldi4bb3in.8,2) ;(evalspeedpldi4bb4in.9,2) ;(evalspeedpldi4bb5in.4,2) ;(evalspeedpldi4bb5in.5,2) ;(evalspeedpldi4entryin.1,2) ;(evalspeedpldi4entryin.2,2) ;(evalspeedpldi4entryin.3,2) ;(evalspeedpldi4returnin.10,2) ;(evalspeedpldi4start.0,2) ;(evalspeedpldi4stop.11,2) ;(exitus616,2)} Rule Graph: [0->{3},1->{4},2->{5},3->{15},4->{15},5->{6,7},6->{9},7->{10},8->{15},9->{11,12},10->{13,14},11->{6,7} ,12->{8},13->{6,7},14->{8},15->{16,17,18,19}] + 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] | `- p:[6,11,9,13,10,7] c: [] MAYBE