NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef1}> undef8, y_6^0 -> (~(1) + y_6^0)}> undef18}> undef22}> Fresh variables: undef1, undef8, undef18, undef22, Undef variables: undef1, undef8, undef18, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) + y_6^0)}> undef22}> Fresh variables: undef1, undef8, undef18, undef22, Undef variables: undef1, undef8, undef18, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + y_6^0, rest remain the same}> undef22, rest remain the same}> Variables: x_5^0, y_6^0, __disjvr_0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002828 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000925s Ranking function: -1 - x_5^0 + y_6^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000403s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001428s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003908s Time used: 0.003766 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005781s Time used: 0.005511 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009428s Time used: 0.009426 LOG: SAT solveNonLinear - Elapsed time: 0.015209s Cost: 1; Total time: 0.014937 Failed at location 1: y_6^0 <= x_5^0 Before Improving: Quasi-invariant at l1: y_6^0 <= x_5^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001497s Remaining time after improvement: 0.999441 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: y_6^0 <= x_5^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: -1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef22, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef22, rest remain the same}> New Graphs: Calling Safety with literal y_6^0 <= x_5^0 and entry LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 1 * Exit transition: * Postcondition : y_6^0 <= x_5^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000200s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000233s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: y_6^0 <= x_5^0 , Narrowing transition: -1 + y_6^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef22, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + y_6^0, rest remain the same}> undef22, rest remain the same}> Variables: x_5^0, y_6^0, __disjvr_0^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000566s Ranking function: -1 - x_5^0 + y_6^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000272s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000963s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002675s Time used: 0.002598 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005277s Time used: 0.005041 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000626s Time used: 4.00026 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002888s Time used: 1.00012 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010475s Time used: 0.004029 Proving non-termination of subgraph 1 Transitions: -1 + y_6^0, rest remain the same}> undef22, rest remain the same}> Variables: x_5^0, y_6^0, __disjvr_0^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000479s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002666s Time used: 5.00257 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.012440s Time used: 5.00156 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.008829s Time used: 5.00062 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 1 Transitions: undef22, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000558s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008596s Time used: 0.008449 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012631s Time used: 0.012628 LOG: SAT solveNonLinear - Elapsed time: 0.021227s Cost: 1; Total time: 0.021077 Failed at location 1: 1 + x_5^0 <= y_6^0 Before Improving: Quasi-invariant at l1: 1 + x_5^0 <= y_6^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004988s Remaining time after improvement: 0.998958 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.001672s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + x_5^0 <= y_6^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): undef22, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + x_5^0 <= y_6^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + x_5^0 <= y_6^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate