9.51/9.60 NO 9.51/9.60 9.51/9.60 Solver Timeout: 4 9.51/9.60 Global Timeout: 300 9.51/9.60 No parsing errors! 9.51/9.60 Init Location: 0 9.51/9.60 Transitions: 9.51/9.60 9.51/9.60 (0 + i^0)}> 9.51/9.60 (1 + i^0)}> 9.51/9.60 9.51/9.60 9.51/9.60 undef19}> 9.51/9.60 9.51/9.60 9.51/9.60 9.51/9.60 0}> 9.51/9.60 9.51/9.60 9.51/9.60 Fresh variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Undef variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Abstraction variables: 9.51/9.60 9.51/9.60 Exit nodes: 9.51/9.60 9.51/9.60 Accepting locations: 9.51/9.60 9.51/9.60 Asserts: 9.51/9.60 9.51/9.60 Preprocessed LLVMGraph 9.51/9.60 Init Location: 0 9.51/9.60 Transitions: 9.51/9.60 9.51/9.60 9.51/9.60 (1 + i^0)}> 9.51/9.60 (1 + i^0)}> 9.51/9.60 (1 + undef19)}> 9.51/9.60 9.51/9.60 Fresh variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Undef variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Abstraction variables: 9.51/9.60 9.51/9.60 Exit nodes: 9.51/9.60 9.51/9.60 Accepting locations: 9.51/9.60 9.51/9.60 Asserts: 9.51/9.60 9.51/9.60 ************************************************************* 9.51/9.60 ******************************************************************************************* 9.51/9.60 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 9.51/9.60 ******************************************************************************************* 9.51/9.60 9.51/9.60 Init Location: 0 9.51/9.60 Graph 0: 9.51/9.60 Transitions: 9.51/9.60 Variables: 9.51/9.60 9.51/9.60 Graph 1: 9.51/9.60 Transitions: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 9.51/9.60 Graph 2: 9.51/9.60 Transitions: 9.51/9.60 Variables: 9.51/9.60 9.51/9.60 Precedence: 9.51/9.60 Graph 0 9.51/9.60 9.51/9.60 Graph 1 9.51/9.60 9.51/9.60 9.51/9.60 Graph 2 9.51/9.60 9.51/9.60 9.51/9.60 Map Locations to Subgraph: 9.51/9.60 ( 0 , 0 ) 9.51/9.60 ( 3 , 1 ) 9.51/9.60 ( 6 , 2 ) 9.51/9.60 9.51/9.60 ******************************************************************************************* 9.51/9.60 ******************************** CHECKING ASSERTIONS ******************************** 9.51/9.60 ******************************************************************************************* 9.51/9.60 9.51/9.60 Proving termination of subgraph 0 9.51/9.60 Proving termination of subgraph 1 9.51/9.60 Checking unfeasibility... 9.51/9.60 Time used: 0.007229 9.51/9.60 9.51/9.60 Checking conditional termination of SCC {l3}... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.001470s 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.009088s 9.51/9.60 Piecewise ranking function: min(-5 + 6*__const_10^0 - 2*__const_5^0 - 4*i^0,-5 + 6*__const_10^0 - 6*__const_5^0) 9.51/9.60 New Graphs: 9.51/9.60 Transitions: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 Checking conditional termination of SCC {l3}... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.000933s 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.004470s 9.51/9.60 Trying to remove transition: 1 + undef19, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009352s 9.51/9.60 Time used: 0.009074 9.51/9.60 Trying to remove transition: 1 + i^0, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009324s 9.51/9.60 Time used: 0.008676 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020448s 9.51/9.60 Time used: 0.019717 9.51/9.60 Improving Solution with cost 1 ... 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetNextSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043244s 9.51/9.60 Time used: 0.043235 9.51/9.60 9.51/9.60 LOG: SAT solveNonLinear - Elapsed time: 0.063692s 9.51/9.60 Cost: 1; Total time: 0.062952 9.51/9.60 Failed at location 3: 1 + __const_5^0 <= i^0 9.51/9.60 Before Improving: 9.51/9.60 Quasi-invariant at l3: 1 + __const_5^0 <= i^0 9.51/9.60 Optimizing invariants... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.006987s 9.51/9.60 Remaining time after improvement: 0.997922 9.51/9.60 Termination implied by a set of quasi-invariant(s): 9.51/9.60 Quasi-invariant at l3: 1 + __const_5^0 <= i^0 9.51/9.60 [ Invariant Graph ] 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 Strengthening transition (result): 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 [ Termination Graph ] 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 > It's unfeasible. Removing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 New Graphs: 9.51/9.60 Calling Safety with literal 1 + __const_5^0 <= i^0 and entry 9.51/9.60 9.51/9.60 LOG: CALL check - Post:1 + __const_5^0 <= i^0 - Process 1 9.51/9.60 * Exit transition: 9.51/9.60 * Postcondition : 1 + __const_5^0 <= i^0 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.000469s 9.51/9.60 > Postcondition is not implied! 9.51/9.60 9.51/9.60 LOG: RETURN check - Elapsed time: 0.000549s 9.51/9.60 INVARIANTS: 9.51/9.60 3: 9.51/9.60 Quasi-INVARIANTS to narrow Graph: 9.51/9.60 3: 1 + __const_5^0 <= i^0 , 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 Narrowing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: Narrow transition size 1 9.51/9.60 Narrowing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: Narrow transition size 1 9.51/9.60 invGraph after Narrowing: 9.51/9.60 Transitions: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 Checking conditional termination of SCC {l3}... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.000973s 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.004554s 9.51/9.60 Trying to remove transition: 1 + undef19, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008519s 9.51/9.60 Time used: 0.008242 9.51/9.60 Trying to remove transition: 1 + i^0, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009423s 9.51/9.60 Time used: 0.008743 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018408s 9.51/9.60 Time used: 0.017564 9.51/9.60 Improving Solution with cost 1 ... 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetNextSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030817s 9.51/9.60 Time used: 0.03081 9.51/9.60 9.51/9.60 LOG: SAT solveNonLinear - Elapsed time: 0.049226s 9.51/9.60 Cost: 1; Total time: 0.048374 9.51/9.60 Failed at location 3: __const_10^0 <= i^0 9.51/9.60 Before Improving: 9.51/9.60 Quasi-invariant at l3: __const_10^0 <= i^0 9.51/9.60 Optimizing invariants... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.005896s 9.51/9.60 Remaining time after improvement: 0.998093 9.51/9.60 Termination implied by a set of quasi-invariant(s): 9.51/9.60 Quasi-invariant at l3: __const_10^0 <= i^0 9.51/9.60 [ Invariant Graph ] 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 [ Termination Graph ] 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 New Graphs: 9.51/9.60 Calling Safety with literal __const_10^0 <= i^0 and entry 9.51/9.60 9.51/9.60 LOG: CALL check - Post:__const_10^0 <= i^0 - Process 2 9.51/9.60 * Exit transition: 9.51/9.60 * Postcondition : __const_10^0 <= i^0 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.000661s 9.51/9.60 > Postcondition is not implied! 9.51/9.60 9.51/9.60 LOG: RETURN check - Elapsed time: 0.000747s 9.51/9.60 INVARIANTS: 9.51/9.60 3: 9.51/9.60 Quasi-INVARIANTS to narrow Graph: 9.51/9.60 3: __const_10^0 <= i^0 , 9.51/9.60 Narrowing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: Narrow transition size 1 9.51/9.60 Narrowing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: Narrow transition size 1 9.51/9.60 invGraph after Narrowing: 9.51/9.60 Transitions: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 Checking conditional termination of SCC {l3}... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.001018s 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.004568s 9.51/9.60 Trying to remove transition: 1 + undef19, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008581s 9.51/9.60 Time used: 0.008373 9.51/9.60 Trying to remove transition: 1 + i^0, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009471s 9.51/9.60 Time used: 0.008738 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020218s 9.51/9.60 Time used: 0.019343 9.51/9.60 Improving Solution with cost 1 ... 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetNextSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.041212s 9.51/9.60 Time used: 0.041204 9.51/9.60 9.51/9.60 LOG: SAT solveNonLinear - Elapsed time: 0.061430s 9.51/9.60 Cost: 1; Total time: 0.060547 9.51/9.60 Failed at location 3: __const_10^0 <= __const_5^0 9.51/9.60 Before Improving: 9.51/9.60 Quasi-invariant at l3: __const_10^0 <= __const_5^0 9.51/9.60 Optimizing invariants... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.006074s 9.51/9.60 Remaining time after improvement: 0.997996 9.51/9.60 Termination implied by a set of quasi-invariant(s): 9.51/9.60 Quasi-invariant at l3: __const_10^0 <= __const_5^0 9.51/9.60 [ Invariant Graph ] 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 Strengthening transition (result): 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 [ Termination Graph ] 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 Strengthening transition (result): 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 It's unfeasible. Removing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 New Graphs: 9.51/9.60 Transitions: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 Checking conditional termination of SCC {l3}... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.001004s 9.51/9.60 Ranking function: -1 + __const_10^0 - i^0 9.51/9.60 New Graphs: 9.51/9.60 Calling Safety with literal __const_10^0 <= __const_5^0 and entry 9.51/9.60 9.51/9.60 LOG: CALL check - Post:__const_10^0 <= __const_5^0 - Process 3 9.51/9.60 * Exit transition: 9.51/9.60 * Postcondition : __const_10^0 <= __const_5^0 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.000618s 9.51/9.60 > Postcondition is not implied! 9.51/9.60 9.51/9.60 LOG: RETURN check - Elapsed time: 0.000715s 9.51/9.60 INVARIANTS: 9.51/9.60 3: 9.51/9.60 Quasi-INVARIANTS to narrow Graph: 9.51/9.60 3: __const_10^0 <= __const_5^0 , 9.51/9.60 Narrowing transition: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: Narrow transition size 1 9.51/9.60 Narrowing transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: Narrow transition size 1 9.51/9.60 invGraph after Narrowing: 9.51/9.60 Transitions: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 Checking conditional termination of SCC {l3}... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.001189s 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.005148s 9.51/9.60 Trying to remove transition: 1 + undef19, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008764s 9.51/9.60 Time used: 0.008358 9.51/9.60 Trying to remove transition: 1 + i^0, rest remain the same}> 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011265s 9.51/9.60 Time used: 0.010537 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001943s 9.51/9.60 Time used: 4.00101 9.51/9.60 Solving with 2 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007350s 9.51/9.60 Time used: 4.00106 9.51/9.60 Solving with 3 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009314s 9.51/9.60 Time used: 1.0009 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026348s 9.51/9.60 Time used: 0.015723 9.51/9.60 9.51/9.60 Proving non-termination of subgraph 1 9.51/9.60 Transitions: 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 9.51/9.60 Checking conditional non-termination of SCC {l3}... 9.51/9.60 EXIT TRANSITIONS: 9.51/9.60 9.51/9.60 9.51/9.60 9.51/9.60 9.51/9.60 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026166s 9.51/9.60 Time used: 0.025891 9.51/9.60 Improving Solution with cost 3 ... 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetNextSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.033684s 9.51/9.60 Time used: 0.033671 9.51/9.60 9.51/9.60 LOG: SAT solveNonLinear - Elapsed time: 0.059850s 9.51/9.60 Cost: 3; Total time: 0.059562 9.51/9.60 Failed at location 3: 1 + __const_5^0 <= __const_10^0 9.51/9.60 Before Improving: 9.51/9.60 Quasi-invariant at l3: 1 + __const_5^0 <= __const_10^0 9.51/9.60 Optimizing invariants... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.008151s 9.51/9.60 Remaining time after improvement: 0.997974 9.51/9.60 Minimizing number of undef constraints... 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinear - Elapsed time: 0.004271s 9.51/9.60 Number of undef constraints reduced! 9.51/9.60 9.51/9.60 Non-termination implied by a set of quasi-invariant(s): 9.51/9.60 Quasi-invariant at l3: 1 + __const_5^0 <= __const_10^0 9.51/9.60 9.51/9.60 Strengthening and disabling EXIT transitions... 9.51/9.60 Closed exits from l3: 3 9.51/9.60 Strengthening exit transition (result): 9.51/9.60 9.51/9.60 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 Strengthening transition (result): 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 Strengthening transition (result): 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 9.51/9.60 Checking conditional non-termination of SCC {l3}... 9.51/9.60 EXIT TRANSITIONS: 9.51/9.60 9.51/9.60 9.51/9.60 Solving with 1 template(s). 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetFirstSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013992s 9.51/9.60 Time used: 0.013755 9.51/9.60 Improving Solution with cost 1 ... 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinearGetNextSolution 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018173s 9.51/9.60 Time used: 0.018165 9.51/9.60 9.51/9.60 LOG: SAT solveNonLinear - Elapsed time: 0.032165s 9.51/9.60 Cost: 1; Total time: 0.03192 9.51/9.60 Failed at location 3: i^0 <= __const_5^0 9.51/9.60 Before Improving: 9.51/9.60 Quasi-invariant at l3: i^0 <= __const_5^0 9.51/9.60 Optimizing invariants... 9.51/9.60 9.51/9.60 LOG: CALL solveLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear - Elapsed time: 0.006083s 9.51/9.60 Remaining time after improvement: 0.998311 9.51/9.60 Minimizing number of undef constraints... 9.51/9.60 9.51/9.60 LOG: CALL solveNonLinear 9.51/9.60 9.51/9.60 LOG: RETURN solveNonLinear - Elapsed time: 0.003552s 9.51/9.60 Number of undef constraints reduced! 9.51/9.60 9.51/9.60 Non-termination implied by a set of quasi-invariant(s): 9.51/9.60 Quasi-invariant at l3: i^0 <= __const_5^0 9.51/9.60 Constraint over undef '1 + undef19 <= __const_5^0' in transition: 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 9.51/9.60 Strengthening and disabling EXIT transitions... 9.51/9.60 Closed exits from l3: 1 9.51/9.60 9.51/9.60 Strengthening and disabling transitions... 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 Strengthening transition (result): 9.51/9.60 1 + i^0, rest remain the same}> 9.51/9.60 9.51/9.60 LOG: CALL solverLinear in Graph for feasibility 9.51/9.60 9.51/9.60 LOG: RETURN solveLinear in Graph for feasibility 9.51/9.60 Strengthening transition (result): 9.51/9.60 1 + undef19, rest remain the same}> 9.51/9.60 9.51/9.60 Calling reachability with... 9.51/9.60 Transition: 9.51/9.60 Conditions: 1 + __const_5^0 <= __const_10^0, i^0 <= __const_5^0, 9.51/9.60 OPEN EXITS: 9.51/9.60 (condsUp: 1 + __const_5^0 <= __const_10^0) 9.51/9.60 9.51/9.60 --- Reachability graph --- 9.51/9.60 > Graph without transitions. 9.51/9.60 9.51/9.60 Calling reachability with... 9.51/9.60 Transition: 9.51/9.60 Conditions: i^0 <= __const_5^0, 1 + __const_5^0 <= __const_10^0, 9.51/9.60 OPEN EXITS: 9.51/9.60 9.51/9.60 9.51/9.60 > Conditions are reachable! 9.51/9.60 9.51/9.60 Program does NOT terminate 9.51/9.60 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 9.51/9.60 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 9.51/9.60 EOF