NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (0 + k_187^0), lt_27^0 -> undef16}> (0 + k_187^0), lt_27^0 -> undef48}> undef65, lt_32^0 -> undef81, lt_34^0 -> undef82, x_19^0 -> (0 + undef97), y_20^0 -> (0 + w_17^0)}> (~(1) + k_243^0), lt_25^0 -> undef111}> (~(1) + k_243^0), lt_25^0 -> undef143}> undef164, ___patmp2^0 -> undef165, k_243^0 -> (0 + undef165), len_263^0 -> (0 + undef164), lt_26^0 -> undef176, lt_27^0 -> undef177, x_13^0 -> (0 + undef194)}> (0 + undef196), ___cil_tmp5_10^0 -> undef196, k_139^0 -> undef200, k_187^0 -> undef201, len_99^0 -> undef206, lt_34^0 -> undef212, lt_35^0 -> undef213, lt_36^0 -> undef214, lt_37^0 -> undef215, lt_38^0 -> undef216, tmp_9^0 -> undef218, x_13^0 -> (0 + a_11^0), x_22^0 -> undef222, x_8^0 -> undef223, y_23^0 -> 0}> undef245, ___patmp2^0 -> undef246, k_243^0 -> (0 + undef246), len_263^0 -> (0 + undef245), lt_24^0 -> undef255, lt_25^0 -> undef256, x_13^0 -> (0 + undef275)}> undef298, y_20^0 -> (0 + undef298)}> undef330, y_20^0 -> (0 + undef330)}> undef362, y_20^0 -> (0 + undef362)}> undef426, y_20^0 -> (0 + undef426)}> undef490, y_20^0 -> (0 + undef490)}> undef522, y_20^0 -> (0 + undef522)}> Fresh variables: undef16, undef48, undef65, undef81, undef82, undef97, undef111, undef143, undef164, undef165, undef176, undef177, undef194, undef196, undef200, undef201, undef206, undef212, undef213, undef214, undef215, undef216, undef218, undef222, undef223, undef227, undef228, undef229, undef230, undef231, undef232, undef233, undef234, undef235, undef236, undef237, undef238, undef239, undef240, undef241, undef242, undef245, undef246, undef255, undef256, undef275, undef298, undef330, undef362, undef426, undef490, undef522, Undef variables: undef16, undef48, undef65, undef81, undef82, undef97, undef111, undef143, undef164, undef165, undef176, undef177, undef194, undef196, undef200, undef201, undef206, undef212, undef213, undef214, undef215, undef216, undef218, undef222, undef223, undef227, undef228, undef229, undef230, undef231, undef232, undef233, undef234, undef235, undef236, undef237, undef238, undef239, undef240, undef241, undef242, undef245, undef246, undef255, undef256, undef275, undef298, undef330, undef362, undef426, undef490, undef522, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef97)}> (0 + undef97)}> (0 + undef246), len_263^0 -> (0 + undef245), x_13^0 -> (0 + undef275)}> (0 + undef246), len_263^0 -> (0 + undef245), x_13^0 -> (0 + undef275)}> Fresh variables: undef16, undef48, undef65, undef81, undef82, undef97, undef111, undef143, undef164, undef165, undef176, undef177, undef194, undef196, undef200, undef201, undef206, undef212, undef213, undef214, undef215, undef216, undef218, undef222, undef223, undef227, undef228, undef229, undef230, undef231, undef232, undef233, undef234, undef235, undef236, undef237, undef238, undef239, undef240, undef241, undef242, undef245, undef246, undef255, undef256, undef275, undef298, undef330, undef362, undef426, undef490, undef522, Undef variables: undef16, undef48, undef65, undef81, undef82, undef97, undef111, undef143, undef164, undef165, undef176, undef177, undef194, undef196, undef200, undef201, undef206, undef212, undef213, undef214, undef215, undef216, undef218, undef222, undef223, undef227, undef228, undef229, undef230, undef231, undef232, undef233, undef234, undef235, undef236, undef237, undef238, undef239, undef240, undef241, undef242, undef245, undef246, undef255, undef256, undef275, undef298, undef330, undef362, undef426, undef490, undef522, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef246, len_263^0 -> undef245, x_13^0 -> undef275, rest remain the same}> undef246, len_263^0 -> undef245, x_13^0 -> undef275, 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 undef97, rest remain the same}> undef97, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 8 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004941 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001341s Ranking function: -1 + k_243^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001803 > No variable changes in termination graph. Checking conditional unfeasibility... Calling Safety with literal w_17^0 <= x_19^0 and entry LOG: CALL check - Post:w_17^0 <= x_19^0 - Process 1 * Exit transition: * Postcondition : w_17^0 <= x_19^0 Postcodition moved up: w_17^0 <= x_19^0 LOG: Try proving POST Postcondition: w_17^0 <= x_19^0 LOG: CALL check - Post:w_17^0 <= x_19^0 - Process 2 * Exit transition: undef97, rest remain the same}> * Postcondition : w_17^0 <= x_19^0 Postcodition moved up: w_17^0 <= undef97 LOG: Try proving POST Postcondition: w_17^0 <= undef97 LOG: CALL check - Post:w_17^0 <= undef97 - Process 3 * Exit transition: * Postcondition : w_17^0 <= undef97 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001042s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001202s Postcondition: w_17^0 <= undef97 LOG: CALL check - Post:w_17^0 <= undef97 - Process 4 * Exit transition: * Postcondition : w_17^0 <= undef97 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001043s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001207s LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 Narrowing transition: undef246, len_263^0 -> undef245, x_13^0 -> undef275, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef246, len_263^0 -> undef245, x_13^0 -> undef275, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef246, len_263^0 -> undef245, x_13^0 -> undef275, rest remain the same}> undef246, len_263^0 -> undef245, x_13^0 -> undef275, rest remain the same}> END GRAPH: EXIT: undef97, rest remain the same}> POST: w_17^0 <= x_19^0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015479s Time used: 0.01542 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.662083s Time used: 0.661297 Improving Solution with cost 54 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000363s Time used: 1.00034 LOG: SAT solveNonLinear - Elapsed time: 1.662446s Cost: 54; Total time: 1.66164 Failed at location 3: x_13^0 <= y_12^0 Failed at location 3: x_13^0 <= y_12^0 Failed at location 3: y_12^0 <= x_13^0 Failed at location 3: y_12^0 <= x_13^0 Before Improving: Quasi-invariant at l3: x_13^0 <= y_12^0 Quasi-invariant at l3: y_12^0 <= x_13^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007111s Remaining time after improvement: 0.998219 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l3: x_13^0 <= y_12^0 Quasi-invariant at l3: 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.001426s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001564s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000169s Time used: 1.00007 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 2.704690s LOG: NarrowEntry size 1 Narrowing transition: LOG: Narrow transition size 1 It's unfeasible. Removing transition: ENTRIES: undef97, rest remain the same}> END ENTRIES: GRAPH: END GRAPH: EXIT: POST: w_17^0 <= x_19^0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003039s Time used: 0.002983 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000625s Time used: 4.00038 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.001812s Time used: 1.00038 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 7.727386s 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.000832s Checking conditional non-termination of SCC {l8}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015182s Time used: 0.014998 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032292s Time used: 0.032291 LOG: SAT solveNonLinear - Elapsed time: 0.047474s Cost: 1; Total time: 0.047289 Failed at location 8: 1 + w_17^0 <= x_19^0 Before Improving: Quasi-invariant at l8: 1 + w_17^0 <= x_19^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008846s Remaining time after improvement: 0.998649 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.002821s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l8: 1 + w_17^0 <= x_19^0 Strengthening and disabling EXIT transitions... Closed exits from l8: 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 + w_17^0 <= x_19^0, Transition: Conditions: 1 + w_17^0 <= x_19^0, OPEN EXITS: (condsUp: 1 + w_17^0 <= x_19^0) (condsUp: 1 + w_17^0 <= x_19^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef97, rest remain the same}> Conditions: 1 + w_17^0 <= x_19^0, Transition: undef97, rest remain the same}> Conditions: 1 + w_17^0 <= x_19^0, Transition: undef97, rest remain the same}> Conditions: 1 + w_17^0 <= x_19^0, Transition: undef97, rest remain the same}> Conditions: 1 + w_17^0 <= x_19^0, OPEN EXITS: undef97, rest remain the same}> (condsUp: 1 + w_17^0 <= undef97, undef97 = undef330, undef97 = undef522, 1 + w_17^0 <= undef97) undef97, rest remain the same}> (condsUp: 1 + w_17^0 <= undef97, undef97 = undef330, undef97 = undef522, 1 + w_17^0 <= undef97) --- 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 + w_17^0 <= undef97, undef97 = undef330, undef97 = undef522, 1 + w_17^0 <= undef97, Transition: Conditions: 0 <= len_263^0, 1 <= k_243^0, x_13^0 = y_12^0, 1 + w_17^0 <= undef97, undef97 = undef330, undef97 = undef522, 1 + w_17^0 <= undef97, Transition: Conditions: 0 <= len_263^0, 1 <= k_243^0, x_13^0 = y_12^0, 1 + w_17^0 <= undef97, undef97 = undef330, undef97 = undef522, 1 + w_17^0 <= undef97, Transition: Conditions: 0 <= len_263^0, 1 <= k_243^0, x_13^0 = y_12^0, 1 + w_17^0 <= undef97, undef97 = undef330, undef97 = undef522, 1 + w_17^0 <= undef97, OPEN EXITS: > Conditions are reachable! Program does NOT terminate