NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef1}> undef2}> undef3}> undef4}> Fresh variables: undef1, undef2, undef3, undef4, Undef variables: undef1, undef2, undef3, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef3}> undef2}> undef2}> Fresh variables: undef1, undef2, undef3, undef4, Undef variables: undef1, undef2, undef3, undef4, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef2, rest remain the same}> Variables: x^0 Precedence: Graph 0 Graph 1 undef3, rest remain the same}> undef2, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001876 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000698s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001959s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002657s Time used: 0.002515 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002031s Time used: 4.00177 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005735s Time used: 4.00122 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003011s Time used: 1.00052 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007519s Time used: 0.003865 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008424s Time used: 0.008422 LOG: SAT solveNonLinear - Elapsed time: 0.015942s Cost: 1; Total time: 0.012287 Termination implied by a set of invariant(s): Invariant at l1: 1 <= x^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef2, rest remain the same}> Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: undef2, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000373s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001413s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002363s Time used: 0.002266 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002180s Time used: 4.00197 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006526s Time used: 4.002 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.060262s Time used: 1.05558 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024862s Time used: 0.003643 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef3, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef3, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000599s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000639s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: undef2, rest remain the same}> Variables: x^0 Checking conditional non-termination of SCC {l1}... > No exit transition to close. Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000514s > No assignment for some undef value. Proving non-termination of subgraph 1 Transitions: undef2, rest remain the same}> Variables: x^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000672s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.074409s Time used: 5.07423 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.028159s Time used: 5.00525 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.015245s Time used: 5.00525 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 50001 <= x^0, Transition: Conditions: 50001 <= x^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef3, rest remain the same}> Conditions: 50001 <= x^0, Transition: undef2, rest remain the same}> Conditions: 50001 <= x^0, Transition: undef3, rest remain the same}> Conditions: 50001 <= x^0, Transition: undef2, rest remain the same}> Conditions: 50001 <= x^0, OPEN EXITS: undef3, rest remain the same}> undef2, rest remain the same}> undef3, rest remain the same}> undef2, rest remain the same}> > Conditions are reachable! Program does NOT terminate