NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> arg1, arg3 -> arg1}> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}> 5) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1)) /\ (undef14 < 10)> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 5) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.032325 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001736s Ranking function: 8 - arg1 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000503s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001762s Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006253s Time used: 0.006114 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000691s Time used: 4.00034 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012117s Time used: 4.00278 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017233s Time used: 1.00012 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014171s Time used: 4.00017 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015196s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.015373s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021364s Time used: 0.021077 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046368s Time used: 0.04636 LOG: SAT solveNonLinear - Elapsed time: 0.067731s Cost: 4; Total time: 0.067437 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg2 <= arg3 Strengthening and disabling EXIT transitions... Closed exits from l3: 3 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011502s Time used: 0.011247 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011840s Time used: 0.011832 LOG: SAT solveNonLinear - Elapsed time: 0.023341s Cost: 1; Total time: 0.023079 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg3 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l3: 2 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012490s Time used: 0.012386 LOG: SAT solveNonLinear - Elapsed time: 0.012490s Cost: 0; Total time: 0.012386 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg1 <= arg3 Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Calling reachability with... Transition: Conditions: arg2 <= arg3, arg3 <= arg2, arg1 <= arg3, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: arg1 <= arg3, arg2 = arg3, OPEN EXITS: > Conditions are reachable! Program does NOT terminate