NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef8, up5^0 -> (~(1) + low6^0)}> undef25, tmp^0 -> (0 + undef25)}> undef31}> (1 + mid4^0)}> (~(1) + mid4^0)}> ~(1), low6^0 -> 0, up5^0 -> 14, x2^0 -> 8}> Fresh variables: undef8, undef25, undef31, Undef variables: undef8, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + undef31)}> (~(1) + undef31)}> undef8, up5^0 -> (~(1) + low6^0)}> (1 + undef31)}> (~(1) + undef31)}> Fresh variables: undef8, undef25, undef31, Undef variables: undef8, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> undef8, up5^0 -> -1 + low6^0, rest remain the same}> 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> Variables: low6^0, up5^0, fvalue3^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.013764 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002045s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008236s Piecewise ranking function: min(1 - 3*low6^0 + 3*up5^0,0) New Graphs: Transitions: 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> Variables: low6^0, up5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001141s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006193s Trying to remove transition: -1 + undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010582s Time used: 0.0102 Trying to remove transition: 1 + undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009909s Time used: 0.008968 Trying to remove transition: -1 + undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009615s Time used: 0.008773 Trying to remove transition: 1 + undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009553s Time used: 0.008699 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044406s Time used: 0.043555 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005082s Time used: 4.0014 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.036640s Time used: 1.00163 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041823s Time used: 0.036621 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.006028s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.006163s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> undef8, up5^0 -> -1 + low6^0, rest remain the same}> 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> Variables: low6^0, up5^0, fvalue3^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.090554s Time used: 0.090443 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.044820s Time used: 5.03886 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.020983s Time used: 5.00012 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 1 Transitions: 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> 1 + undef31, rest remain the same}> -1 + undef31, rest remain the same}> Variables: low6^0, up5^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030080s Time used: 0.029972 LOG: SAT solveNonLinear - Elapsed time: 0.030080s Cost: 0; Total time: 0.029972 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.008658s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + low6^0 <= up5^0 Constraint over undef '1 + undef31 <= low6^0' in transition: 1 + undef31, rest remain the same}> Constraint over undef '1 + up5^0 <= undef31' in transition: -1 + undef31, rest remain the same}> Constraint over undef '1 + undef31 <= low6^0' in transition: 1 + undef31, rest remain the same}> Constraint over undef '1 + up5^0 <= undef31' in transition: -1 + undef31, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + undef31, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + undef31, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + undef31, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + undef31, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + low6^0 <= up5^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + low6^0 <= up5^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate