NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}> ~(5), arg2 -> undef12}> (arg1 + 1), arg2 -> undef14}> ~(5)), par{arg1 -> (arg1 + 1), arg2 -> undef16}> undef17, arg2 -> undef18}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef18 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef17 > 0) /\ (undef8 > ~(1)) /\ (undef18 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef17 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0)> ~(5)}> (arg1 + 1)}> ~(5)), par{arg1 -> (arg1 + 1)}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -5, rest remain the same}> 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 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.005558 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001121s Ranking function: -6 - arg1 New Graphs: Transitions: -5, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000782s Ranking function: -1 - arg1 New Graphs: Transitions: -5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000356s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001003s Trying to remove transition: -5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.657717s Time used: 0.657427 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011196s Time used: 0.008326 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021780s Time used: 0.021774 LOG: SAT solveNonLinear - Elapsed time: 0.032976s Cost: 1; Total time: 0.0301 Failed at location 3: 0 <= 1 + arg1 Before Improving: Quasi-invariant at l3: 0 <= 1 + arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004911s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001236s Remaining time after improvement: 0.997184 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 0 <= 4 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, 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}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -5, rest remain the same}> New Graphs: Calling Safety with literal 0 <= 4 + arg1 and entry LOG: CALL check - Post:0 <= 4 + arg1 - Process 1 * Exit transition: * Postcondition : 0 <= 4 + arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000594s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000746s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 0 <= 4 + arg1 , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> invGraph after Narrowing: Transitions: -5, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000785s Ranking function: -5 - arg1 New Graphs: Transitions: -5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000368s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001023s Trying to remove transition: -5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.654594s Time used: 0.654442 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003832s Time used: 4.00083 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.037917s Time used: 4.03309 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008443s Time used: 1.00053 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.436008s Time used: 0.428718 Proving non-termination of subgraph 1 Transitions: -5, 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.016967s Time used: 0.016766 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008846s Time used: 0.00884 LOG: SAT solveNonLinear - Elapsed time: 0.025813s Cost: 1; Total time: 0.025606 Failed at location 3: 5 + arg1 <= 0 Before Improving: Quasi-invariant at l3: 5 + arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002372s Remaining time after improvement: 0.999018 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 5 + arg1 <= 0 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): -5, 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: 5 + arg1 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 5 + arg1 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate