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