NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: undef1, lt_11^0 -> undef6, lt_12^0 -> undef7}> undef20, lt_12^0 -> undef21, tmp_9^0 -> undef24}> undef46, lt_12^0 -> undef47, tmp_9^0 -> undef50}> undef56}> undef71}> (0 + undef103), p_7^0 -> (0 + undef102), x_5^0 -> undef102, y_6^0 -> undef103}> Fresh variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Undef variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef56}> Fresh variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Undef variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef56, rest remain the same}> Variables: cnt_20^0, cnt_25^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.003535 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000815s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001752s Trying to remove transition: undef56, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005485s Time used: 0.005332 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006779s Time used: 0.006295 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011491s Time used: 0.01149 LOG: SAT solveNonLinear - Elapsed time: 0.018270s Cost: 1; Total time: 0.017785 Failed at location 1: cnt_25^0 <= cnt_20^0 Before Improving: Quasi-invariant at l1: cnt_25^0 <= cnt_20^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002236s Remaining time after improvement: 0.999098 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: cnt_25^0 <= cnt_20^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: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef56, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef56, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: New Graphs: Calling Safety with literal cnt_25^0 <= cnt_20^0 and entry LOG: CALL check - Post:cnt_25^0 <= cnt_20^0 - Process 1 * Exit transition: * Postcondition : cnt_25^0 <= cnt_20^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000238s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000268s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: cnt_25^0 <= cnt_20^0 , Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: undef56, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef56, rest remain the same}> Variables: cnt_20^0, cnt_25^0, __disjvr_0^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000397s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001610s Trying to remove transition: undef56, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003912s Time used: 0.003792 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007610s Time used: 0.007225 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000754s Time used: 4.00023 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003350s Time used: 1.00005 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013240s Time used: 0.0053 Proving non-termination of subgraph 1 Transitions: undef56, rest remain the same}> Variables: cnt_20^0, cnt_25^0, __disjvr_0^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001511s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036689s Time used: 0.036258 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031167s Time used: 0.031164 LOG: SAT solveNonLinear - Elapsed time: 0.067856s Cost: 1; Total time: 0.067422 Failed at location 1: 1 + cnt_20^0 <= cnt_25^0 Before Improving: Quasi-invariant at l1: 1 + cnt_20^0 <= cnt_25^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003891s Remaining time after improvement: 0.998077 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.004099s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + cnt_20^0 <= cnt_25^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): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef56, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + cnt_20^0 <= cnt_25^0, OPEN EXITS: (condsUp: 1 + cnt_20^0 <= cnt_25^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + cnt_20^0 <= cnt_25^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate