NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}> ~(1)) /\ (arg2 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17), arg2 -> undef16}> 0, arg2 -> undef21}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef23}> 0, arg2 -> undef25}> (arg1 + 1), arg2 -> undef27}> undef28, arg2 -> undef29}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef29 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef28 > 0) /\ (undef6 > ~(1)) /\ (undef29 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef28 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef29 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef28 > 0) /\ (undef17 > ~(1)) /\ (undef29 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef28 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> ~(1)) /\ (undef29 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef28 > 0) /\ (undef6 > ~(1)) /\ (undef29 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef28 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef29 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef28 > 0) /\ (undef17 > ~(1)) /\ (undef29 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef28 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> 0}> 0), par{arg1 -> (arg1 - 1)}> 0}> (arg1 + 1)}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Graph 2: Transitions: 0, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 -undef17, rest remain the same}> -undef17, rest remain the same}> Graph 2 undef6, rest remain the same}> undef6, rest remain the same}> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001407 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000448s Ranking function: -1 - arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.002072 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000551s Ranking function: -1 + arg1 New Graphs: Transitions: 0, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000221s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000553s Trying to remove transition: 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001623s Time used: 0.00154 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002141s Time used: 4.00172 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007437s Time used: 4.00138 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004714s Time used: 1.00056 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006028s Time used: 0.002523 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef6, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef6, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000647s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000707s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: 0, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002431s Time used: 0.002371 LOG: SAT solveNonLinear - Elapsed time: 0.002431s Cost: 0; Total time: 0.002371 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 0 <= arg1 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): 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= arg1, Transition: Conditions: 0 <= arg1, Transition: Conditions: 0 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef6, rest remain the same}> Conditions: 0 <= arg1, Transition: undef6, rest remain the same}> Conditions: 0 <= arg1, Transition: undef6, rest remain the same}> Conditions: 0 <= arg1, Transition: undef6, rest remain the same}> Conditions: 0 <= arg1, Transition: undef6, rest remain the same}> Conditions: 0 <= arg1, Transition: undef6, rest remain the same}> Conditions: 0 <= arg1, OPEN EXITS: undef6, rest remain the same}> undef6, rest remain the same}> undef6, rest remain the same}> undef6, rest remain the same}> undef6, rest remain the same}> undef6, rest remain the same}> > Conditions are reachable! Program does NOT terminate