NO Solver Timeout: 4 Global Timeout: 300 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_1000^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.001697 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000640s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002000s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003468s Time used: 0.003317 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004200s Time used: 0.003954 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.006945s Time used: 0.006943 LOG: SAT solveNonLinear - Elapsed time: 0.011145s Cost: 1; Total time: 0.010897 Failed at location 1: 1 + __const_1000^0 + x^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + __const_1000^0 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000925s Remaining time after improvement: 0.999583 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + __const_1000^0 + x^0 <= 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 + __const_1000^0 + x^0 <= 0 and entry LOG: CALL check - Post:1 + __const_1000^0 + x^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + __const_1000^0 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000158s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000185s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_1000^0 + x^0 <= 0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000339s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001124s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002003s Time used: 0.001923 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003939s Time used: 0.003736 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005538s Time used: 0.005537 LOG: SAT solveNonLinear - Elapsed time: 0.009477s Cost: 1; Total time: 0.009273 Failed at location 1: __const_1000^0 + x^0 <= 0 Before Improving: Quasi-invariant at l1: __const_1000^0 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000983s Remaining time after improvement: 0.999518 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 + x^0 <= 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... > It's unfeasible. Removing transition: undef2, rest remain the same}> New Graphs: Calling Safety with literal __const_1000^0 + x^0 <= 0 and entry LOG: CALL check - Post:__const_1000^0 + x^0 <= 0 - Process 2 * Exit transition: * Postcondition : __const_1000^0 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000182s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000212s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_1000^0 + x^0 <= 0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000289s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001031s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002148s Time used: 0.002067 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003945s Time used: 0.003745 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004780s Time used: 0.004779 LOG: SAT solveNonLinear - Elapsed time: 0.008725s Cost: 1; Total time: 0.008524 Failed at location 1: 1 + __const_1000^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + __const_1000^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001034s Remaining time after improvement: 0.99947 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + __const_1000^0 <= 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}> Ranking function: __const_1000^0 + x^0 New Graphs: Calling Safety with literal 1 + __const_1000^0 <= 0 and entry LOG: CALL check - Post:1 + __const_1000^0 <= 0 - Process 3 * Exit transition: * Postcondition : 1 + __const_1000^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000159s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000186s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_1000^0 <= 0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000319s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001091s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002220s Time used: 0.002136 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004013s Time used: 0.003857 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002206s Time used: 4.00021 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002371s Time used: 1.00019 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004726s Time used: 0.003281 Proving non-termination of subgraph 1 Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000536s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008330s Time used: 0.008196 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018432s Time used: 0.018429 LOG: SAT solveNonLinear - Elapsed time: 0.026762s Cost: 2; Total time: 0.026625 Failed at location 1: 1 <= __const_1000^0 Before Improving: Quasi-invariant at l1: 1 <= __const_1000^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004044s Remaining time after improvement: 0.999099 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.001635s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= __const_1000^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 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): undef2, rest remain the same}> Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006855s Time used: 0.006728 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010197s Time used: 0.010195 LOG: SAT solveNonLinear - Elapsed time: 0.017051s Cost: 1; Total time: 0.016923 Failed at location 1: 1 <= x^0 Before Improving: Quasi-invariant at l1: 1 <= x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003811s Remaining time after improvement: 0.999098 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.001531s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= 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_1000^0, 1 <= x^0, OPEN EXITS: (condsUp: 1 <= __const_1000^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= x^0, 1 <= __const_1000^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate