NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef2}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef2}> Fresh variables: undef2, Undef variables: undef2, 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: __const_200^0, x^0 Precedence: Graph 0 Graph 1 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.001915 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000568s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002139s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004752s Time used: 0.004606 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007014s Time used: 0.006646 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013818s Time used: 0.013812 LOG: SAT solveNonLinear - Elapsed time: 0.020832s Cost: 1; Total time: 0.020458 Failed at location 1: 1 + x^0 <= __const_200^0 Before Improving: Quasi-invariant at l1: 1 + x^0 <= __const_200^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001981s Remaining time after improvement: 0.999026 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + x^0 <= __const_200^0 [ 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: 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 It's unfeasible. Removing transition: undef2, rest remain the same}> New Graphs: Calling Safety with literal 1 + x^0 <= __const_200^0 and entry LOG: CALL check - Post:1 + x^0 <= __const_200^0 - Process 1 * Exit transition: * Postcondition : 1 + x^0 <= __const_200^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000352s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000426s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + x^0 <= __const_200^0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000608s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002291s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004368s Time used: 0.004209 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001360s Time used: 4.00078 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006120s Time used: 4.00084 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004007s Time used: 1.00048 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010255s Time used: 0.006636 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010528s Time used: 0.0105 LOG: SAT solveNonLinear - Elapsed time: 0.020783s Cost: 1; Total time: 0.017136 Quasi-ranking function: 50000 + __const_200^0 - x^0 New Graphs: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000649s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002840s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005385s Time used: 0.005217 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001362s Time used: 4.00082 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.021861s Time used: 4.01562 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003800s Time used: 1.00046 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010723s Time used: 0.007304 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015700s Time used: 0.015693 LOG: SAT solveNonLinear - Elapsed time: 0.026424s Cost: 1; Total time: 0.022997 Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000737s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003043s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005857s Time used: 0.005679 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004339s Time used: 4.00352 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006537s Time used: 4.00076 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003855s Time used: 1.00063 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013152s Time used: 0.009844 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014567s Time used: 0.014561 LOG: SAT solveNonLinear - Elapsed time: 0.027719s Cost: 1; Total time: 0.024405 Quasi-ranking function: 50000 - __const_200^0 - x^0 New Graphs: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000831s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003433s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006736s Time used: 0.006543 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.737777s Time used: 2.73691 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.998970s Time used: 0.994565 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.995829s Time used: 0.993489 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011637s Time used: 0.008468 Proving non-termination of subgraph 1 Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001147s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014932s Time used: 0.014524 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022470s Time used: 0.022461 LOG: SAT solveNonLinear - Elapsed time: 0.037401s Cost: 1; Total time: 0.036985 Failed at location 1: 1 + __const_200^0 <= x^0 Before Improving: Quasi-invariant at l1: 1 + __const_200^0 <= x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007540s Remaining time after improvement: 0.998271 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003578s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + __const_200^0 <= x^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 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}> Calling reachability with... Transition: Conditions: 1 + __const_200^0 <= x^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + __const_200^0 <= x^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate