NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef1, __cil_tmp2_6^0 -> undef2, selected_11^0 -> (0 + undef8)}> undef9, __cil_tmp2_6^0 -> undef10, selected_11^0 -> (0 + undef16)}> (0 + undef19), __cil_tmp6_12^0 -> undef19}> undef24, __cil_tmp2_6^0 -> undef25, selected_11^0 -> (0 + undef31)}> (1 + retryCount_10^0)}> 4, retryCount_10^0 -> 0, selected_11^0 -> 0}> Fresh variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Undef variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + retryCount_10^0), selected_11^0 -> (0 + undef31)}> Fresh variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Undef variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002452 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000832s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002197s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006960s Time used: 0.006782 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001997s Time used: 4.00131 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006175s Time used: 4.00089 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006208s Time used: 1.00052 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013208s Time used: 0.008278 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.014171s Time used: 1.0141 LOG: SAT solveNonLinear - Elapsed time: 1.027379s Cost: 1; Total time: 1.02238 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + retryCount_10^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + retryCount_10^0, selected_11^0 -> undef31, 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): 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Quasi-ranking function: 50000 - retryCount_10^0 New Graphs: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000666s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002655s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007186s Time used: 0.007015 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002427s Time used: 4.00169 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006515s Time used: 4.00105 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006227s Time used: 1.00048 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015545s Time used: 0.010383 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001010s Time used: 1.00093 LOG: SAT solveNonLinear - Elapsed time: 1.016555s Cost: 1; Total time: 1.01131 Quasi-ranking function: 50000 - retryCount_10^0 + x_5^0 New Graphs: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000811s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003219s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007889s Time used: 0.0077 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004066s Time used: 4.00312 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005715s Time used: 4.00099 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005861s Time used: 1.00061 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016300s Time used: 0.011286 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.779398s Time used: 0.779342 LOG: SAT solveNonLinear - Elapsed time: 0.795698s Cost: 1; Total time: 0.790628 Quasi-ranking function: 50000 - retryCount_10^0 - x_5^0 New Graphs: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000896s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003606s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008194s Time used: 0.007986 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.961086s Time used: 0.960368 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.996985s Time used: 0.993847 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.997805s Time used: 0.994314 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000051s Time used: 0.994988 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005130s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.005253s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional non-termination of SCC {l4}... > No exit transition to close. Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002721s Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: OPEN EXITS: > Conditions are reachable! Program does NOT terminate