NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef1, lt_32^0 -> undef17, lt_34^0 -> undef18, x_19^0 -> (0 + undef33), y_20^0 -> (0 + w_17^0)}> undef120, y_20^0 -> (0 + undef120)}> undef216, y_20^0 -> (0 + undef216)}> (~(1) + k_243^0)}> undef324, ___patmp2^0 -> undef325, k_243^0 -> (0 + undef325), len_263^0 -> (0 + undef324), lt_24^0 -> undef334, lt_25^0 -> undef335, x_13^0 -> (0 + undef354)}> (0 + undef389), ___cil_tmp5_10^0 -> undef389, k_139^0 -> undef393, k_187^0 -> undef394, k_208^0 -> (0 + undef394), len_99^0 -> undef399, lt_34^0 -> undef405, lt_35^0 -> undef406, lt_36^0 -> undef407, lt_37^0 -> undef408, lt_38^0 -> undef409, tmp_9^0 -> undef411, x_13^0 -> (0 + a_11^0), x_22^0 -> undef415, x_8^0 -> undef416, y_23^0 -> 0}> undef502, ___patmp2^0 -> undef503, k_243^0 -> (0 + undef503), len_263^0 -> (0 + undef502), lt_26^0 -> undef514, lt_27^0 -> undef515, x_13^0 -> (0 + undef532)}> undef620, y_20^0 -> (0 + undef620)}> Fresh variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Undef variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef33)}> (0 + undef33)}> (0 + undef325), len_263^0 -> (0 + undef324), x_13^0 -> (0 + undef354)}> (0 + undef325), len_263^0 -> (0 + undef324), x_13^0 -> (0 + undef354)}> Fresh variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Undef variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> Variables: k_243^0, len_263^0, x_13^0, y_12^0 Graph 2: Transitions: Variables: w_17^0, x_19^0 Precedence: Graph 0 Graph 1 Graph 2 undef33, rest remain the same}> undef33, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.010748 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002704s Ranking function: -1 + k_243^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.003748 > No variable changes in termination graph. Checking conditional unfeasibility... Calling Safety with literal x_19^0 <= w_17^0 and entry LOG: CALL check - Post:x_19^0 <= w_17^0 - Process 1 * Exit transition: * Postcondition : x_19^0 <= w_17^0 Postcodition moved up: x_19^0 <= w_17^0 LOG: Try proving POST Postcondition: x_19^0 <= w_17^0 LOG: CALL check - Post:x_19^0 <= w_17^0 - Process 2 * Exit transition: undef33, rest remain the same}> * Postcondition : x_19^0 <= w_17^0 Postcodition moved up: undef33 <= w_17^0 LOG: Try proving POST Postcondition: undef33 <= w_17^0 LOG: CALL check - Post:undef33 <= w_17^0 - Process 3 * Exit transition: * Postcondition : undef33 <= w_17^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002328s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002650s Postcondition: undef33 <= w_17^0 LOG: CALL check - Post:undef33 <= w_17^0 - Process 4 * Exit transition: * Postcondition : undef33 <= w_17^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002316s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002634s LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 Narrowing transition: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> END GRAPH: EXIT: undef33, rest remain the same}> POST: x_19^0 <= w_17^0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034894s Time used: 0.034783 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.018152s Time used: 1.01634 Improving Solution with cost 54 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001106s Time used: 1.00111 LOG: SAT solveNonLinear - Elapsed time: 2.019258s Cost: 54; Total time: 2.01746 Failed at location 1: x_13^0 <= y_12^0 Failed at location 1: x_13^0 <= y_12^0 Failed at location 1: y_12^0 <= x_13^0 Failed at location 1: y_12^0 <= x_13^0 Before Improving: Quasi-invariant at l1: x_13^0 <= y_12^0 Quasi-invariant at l1: y_12^0 <= x_13^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027369s Remaining time after improvement: 0.996282 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l1: x_13^0 <= y_12^0 Quasi-invariant at l1: y_12^0 <= x_13^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:x_13^0 <= y_12^0 - Process 5 * Exit transition: * Postcondition : x_13^0 <= y_12^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003092s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.003433s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000282s Time used: 1.00002 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 3.124461s LOG: NarrowEntry size 1 Narrowing transition: LOG: Narrow transition size 1 It's unfeasible. Removing transition: ENTRIES: undef33, rest remain the same}> END ENTRIES: GRAPH: END GRAPH: EXIT: POST: x_19^0 <= w_17^0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006664s Time used: 0.006563 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001127s Time used: 4.00068 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002562s Time used: 1.00061 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 8.156872s Proving non-termination of subgraph 2 Transitions: Variables: w_17^0, x_19^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001748s Checking conditional non-termination of SCC {l6}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034582s Time used: 0.034162 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071807s Time used: 0.071801 LOG: SAT solveNonLinear - Elapsed time: 0.106389s Cost: 1; Total time: 0.105963 Failed at location 6: 1 + x_19^0 <= w_17^0 Before Improving: Quasi-invariant at l6: 1 + x_19^0 <= w_17^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016940s Remaining time after improvement: 0.99744 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.005568s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l6: 1 + x_19^0 <= w_17^0 Strengthening and disabling EXIT transitions... Closed exits from l6: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): Calling reachability with... Transition: Conditions: 1 + x_19^0 <= w_17^0, Transition: Conditions: 1 + x_19^0 <= w_17^0, OPEN EXITS: (condsUp: 1 + x_19^0 <= w_17^0) (condsUp: 1 + x_19^0 <= w_17^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef33, rest remain the same}> Conditions: 1 + x_19^0 <= w_17^0, Transition: undef33, rest remain the same}> Conditions: 1 + x_19^0 <= w_17^0, Transition: undef33, rest remain the same}> Conditions: 1 + x_19^0 <= w_17^0, Transition: undef33, rest remain the same}> Conditions: 1 + x_19^0 <= w_17^0, OPEN EXITS: undef33, rest remain the same}> (condsUp: 1 + undef33 <= w_17^0, undef33 = undef120, undef33 = undef216, 1 + undef33 <= w_17^0) undef33, rest remain the same}> (condsUp: 1 + undef33 <= w_17^0, undef33 = undef120, undef33 = undef216, 1 + undef33 <= w_17^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= len_263^0, 1 <= k_243^0, x_13^0 = y_12^0, 1 + undef33 <= w_17^0, undef33 = undef120, undef33 = undef216, 1 + undef33 <= w_17^0, Transition: Conditions: 0 <= len_263^0, 1 <= k_243^0, x_13^0 = y_12^0, 1 + undef33 <= w_17^0, undef33 = undef120, undef33 = undef216, 1 + undef33 <= w_17^0, Transition: Conditions: 0 <= len_263^0, 1 <= k_243^0, x_13^0 = y_12^0, 1 + undef33 <= w_17^0, undef33 = undef120, undef33 = undef216, 1 + undef33 <= w_17^0, Transition: Conditions: 0 <= len_263^0, 1 <= k_243^0, x_13^0 = y_12^0, 1 + undef33 <= w_17^0, undef33 = undef120, undef33 = undef216, 1 + undef33 <= w_17^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate