66.60/66.75 NO 66.60/66.75 66.60/66.75 Solver Timeout: 4 66.60/66.75 Global Timeout: 300 66.60/66.75 No parsing errors! 66.60/66.75 Init Location: 0 66.60/66.75 Transitions: 66.60/66.75 66.60/66.75 0, arg2 -> 100}> 66.60/66.75 arg1) /\ (arg2 > arg1), par{arg1 -> (arg1 + 1)}> 66.60/66.75 (arg2 - 1), arg2 -> (arg2 + 1)}> 66.60/66.75 undef7, arg2 -> undef8}> 66.60/66.75 66.60/66.75 Fresh variables: 66.60/66.75 undef7, undef8, 66.60/66.75 66.60/66.75 Undef variables: 66.60/66.75 undef7, undef8, 66.60/66.75 66.60/66.75 Abstraction variables: 66.60/66.75 66.60/66.75 Exit nodes: 66.60/66.75 66.60/66.75 Accepting locations: 66.60/66.75 66.60/66.75 Asserts: 66.60/66.75 66.60/66.75 Preprocessed LLVMGraph 66.60/66.75 Init Location: 0 66.60/66.75 Transitions: 66.60/66.75 66.60/66.75 arg1) /\ (arg2 > arg1), par{arg1 -> (arg1 + 1)}> 66.60/66.75 (arg2 - 1), arg2 -> (arg2 + 1)}> 66.60/66.75 66.60/66.75 Fresh variables: 66.60/66.75 undef7, undef8, 66.60/66.75 66.60/66.75 Undef variables: 66.60/66.75 undef7, undef8, 66.60/66.75 66.60/66.75 Abstraction variables: 66.60/66.75 66.60/66.75 Exit nodes: 66.60/66.75 66.60/66.75 Accepting locations: 66.60/66.75 66.60/66.75 Asserts: 66.60/66.75 66.60/66.75 ************************************************************* 66.60/66.75 ******************************************************************************************* 66.60/66.75 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 66.60/66.75 ******************************************************************************************* 66.60/66.75 66.60/66.75 Init Location: 0 66.60/66.75 Graph 0: 66.60/66.75 Transitions: 66.60/66.75 Variables: 66.60/66.75 66.60/66.75 Graph 1: 66.60/66.75 Transitions: 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 66.60/66.75 Precedence: 66.60/66.75 Graph 0 66.60/66.75 66.60/66.75 Graph 1 66.60/66.75 66.60/66.75 66.60/66.75 Map Locations to Subgraph: 66.60/66.75 ( 0 , 0 ) 66.60/66.75 ( 2 , 1 ) 66.60/66.75 66.60/66.75 ******************************************************************************************* 66.60/66.75 ******************************** CHECKING ASSERTIONS ******************************** 66.60/66.75 ******************************************************************************************* 66.60/66.75 66.60/66.75 Proving termination of subgraph 0 66.60/66.75 Proving termination of subgraph 1 66.60/66.75 Checking unfeasibility... 66.60/66.75 Time used: 2.62781 66.60/66.75 66.60/66.75 Checking conditional termination of SCC {l2}... 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.012312s 66.60/66.75 Ranking function: -2 - arg1 + arg2 66.60/66.75 New Graphs: 66.60/66.75 Transitions: 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 Checking conditional termination of SCC {l2}... 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.000448s 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.001438s 66.60/66.75 Trying to remove transition: -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010492s 66.60/66.75 Time used: 0.010356 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.107226s 66.60/66.75 Time used: 4.10647 66.60/66.75 Solving with 2 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.039317s 66.60/66.75 Time used: 4.00061 66.60/66.75 Solving with 3 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.015997s 66.60/66.75 Time used: 1.00012 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017321s 66.60/66.75 Time used: 0.010598 66.60/66.75 Improving Solution with cost 1 ... 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetNextSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000637s 66.60/66.75 Time used: 1.00047 66.60/66.75 66.60/66.75 LOG: SAT solveNonLinear - Elapsed time: 1.017957s 66.60/66.75 Cost: 1; Total time: 1.01107 66.60/66.75 Termination implied by a set of invariant(s): 66.60/66.75 Invariant at l2: 0 <= arg1 66.60/66.75 [ Invariant Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 [ Termination Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Quasi-ranking function: 50000 - arg1 66.60/66.75 New Graphs: 66.60/66.75 Transitions: 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 Checking conditional termination of SCC {l2}... 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.000575s 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.002134s 66.60/66.75 Trying to remove transition: -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017529s 66.60/66.75 Time used: 0.01738 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001653s 66.60/66.75 Time used: 4.00104 66.60/66.75 Solving with 2 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.040573s 66.60/66.75 Time used: 4.00101 66.60/66.75 Solving with 3 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.026224s 66.60/66.75 Time used: 1.00058 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018482s 66.60/66.75 Time used: 0.012089 66.60/66.75 Improving Solution with cost 1 ... 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetNextSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001091s 66.60/66.75 Time used: 1.00093 66.60/66.75 66.60/66.75 LOG: SAT solveNonLinear - Elapsed time: 1.019572s 66.60/66.75 Cost: 1; Total time: 1.01302 66.60/66.75 Termination implied by a set of invariant(s): 66.60/66.75 Invariant at l2: 0 <= 1 + arg2 66.60/66.75 [ Invariant Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 [ Termination Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Quasi-ranking function: 50000 + arg1 - 2*arg2 66.60/66.75 New Graphs: 66.60/66.75 Transitions: 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 Checking conditional termination of SCC {l2}... 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.000756s 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.002830s 66.60/66.75 Trying to remove transition: -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019610s 66.60/66.75 Time used: 0.019448 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004017s 66.60/66.75 Time used: 4.00331 66.60/66.75 Solving with 2 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.041897s 66.60/66.75 Time used: 4.00115 66.60/66.75 Solving with 3 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027348s 66.60/66.75 Time used: 1.00074 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020808s 66.60/66.75 Time used: 0.013598 66.60/66.75 Improving Solution with cost 1 ... 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetNextSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001121s 66.60/66.75 Time used: 1.00098 66.60/66.75 66.60/66.75 LOG: SAT solveNonLinear - Elapsed time: 1.021929s 66.60/66.75 Cost: 1; Total time: 1.01458 66.60/66.75 Termination implied by a set of invariant(s): 66.60/66.75 Invariant at l2: 0 <= 1 + arg2 66.60/66.75 [ Invariant Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 [ Termination Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Quasi-ranking function: 50000 - 2*arg1 + arg2 66.60/66.75 New Graphs: 66.60/66.75 Transitions: 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 Checking conditional termination of SCC {l2}... 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.000878s 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.003089s 66.60/66.75 Trying to remove transition: -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018291s 66.60/66.75 Time used: 0.01811 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002657s 66.60/66.75 Time used: 4.00181 66.60/66.75 Solving with 2 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.061330s 66.60/66.75 Time used: 4.04798 66.60/66.75 Solving with 3 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.026458s 66.60/66.75 Time used: 1.00069 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023877s 66.60/66.75 Time used: 0.016567 66.60/66.75 Improving Solution with cost 1 ... 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetNextSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.016059s 66.60/66.75 Time used: 1.01591 66.60/66.75 66.60/66.75 LOG: SAT solveNonLinear - Elapsed time: 1.039936s 66.60/66.75 Cost: 1; Total time: 1.03248 66.60/66.75 Termination implied by a set of invariant(s): 66.60/66.75 Invariant at l2: arg1 <= 1 + arg2 66.60/66.75 [ Invariant Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 [ Termination Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Quasi-ranking function: 50000 - arg2 66.60/66.75 New Graphs: 66.60/66.75 Transitions: 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 Checking conditional termination of SCC {l2}... 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.000885s 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.003221s 66.60/66.75 Trying to remove transition: -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018679s 66.60/66.75 Time used: 0.018508 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003176s 66.60/66.75 Time used: 4.00245 66.60/66.75 Solving with 2 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.039742s 66.60/66.75 Time used: 4.0012 66.60/66.75 Solving with 3 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.015739s 66.60/66.75 Time used: 1.00057 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021868s 66.60/66.75 Time used: 0.015013 66.60/66.75 Improving Solution with cost 1 ... 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetNextSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001278s 66.60/66.75 Time used: 1.00113 66.60/66.75 66.60/66.75 LOG: SAT solveNonLinear - Elapsed time: 1.023145s 66.60/66.75 Cost: 1; Total time: 1.01614 66.60/66.75 Termination implied by a set of invariant(s): 66.60/66.75 Invariant at l2: arg1 <= arg2 66.60/66.75 [ Invariant Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 [ Termination Graph ] 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Quasi-ranking function: 50000 - arg1 - arg2 66.60/66.75 New Graphs: 66.60/66.75 Transitions: 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 Checking conditional termination of SCC {l2}... 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.000970s 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.003750s 66.60/66.75 Trying to remove transition: -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021328s 66.60/66.75 Time used: 0.021145 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002905s 66.60/66.75 Time used: 4.00218 66.60/66.75 Solving with 2 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.032915s 66.60/66.75 Time used: 4.00119 66.60/66.75 Solving with 3 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008123s 66.60/66.75 Time used: 1.00069 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007941s 66.60/66.75 Time used: 4.00184 66.60/66.75 Termination failed. Trying to show unreachability... 66.60/66.75 Proving unreachability of entry: 66.60/66.75 66.60/66.75 LOG: CALL check - Post:1 <= 0 - Process 1 66.60/66.75 * Exit transition: 66.60/66.75 * Postcondition : 1 <= 0 66.60/66.75 66.60/66.75 LOG: CALL solveLinear 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear - Elapsed time: 0.015822s 66.60/66.75 > Postcondition is not implied! 66.60/66.75 66.60/66.75 LOG: RETURN check - Elapsed time: 0.015944s 66.60/66.75 Cannot prove unreachability 66.60/66.75 66.60/66.75 Proving non-termination of subgraph 1 66.60/66.75 Transitions: 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 Variables: 66.60/66.75 arg1, arg2 66.60/66.75 66.60/66.75 Checking conditional non-termination of SCC {l2}... 66.60/66.75 EXIT TRANSITIONS: 66.60/66.75 66.60/66.75 66.60/66.75 Solving with 1 template(s). 66.60/66.75 66.60/66.75 LOG: CALL solveNonLinearGetFirstSolution 66.60/66.75 66.60/66.75 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017085s 66.60/66.75 Time used: 0.016982 66.60/66.75 66.60/66.75 LOG: SAT solveNonLinear - Elapsed time: 0.017085s 66.60/66.75 Cost: 0; Total time: 0.016982 66.60/66.75 Non-termination implied by a set of quasi-invariant(s): 66.60/66.75 Quasi-invariant at l2: 2 + arg1 <= arg2 66.60/66.75 66.60/66.75 Strengthening and disabling EXIT transitions... 66.60/66.75 Closed exits from l2: 1 66.60/66.75 66.60/66.75 Strengthening and disabling transitions... 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 1 + arg1, rest remain the same}> 66.60/66.75 66.60/66.75 LOG: CALL solverLinear in Graph for feasibility 66.60/66.75 66.60/66.75 LOG: RETURN solveLinear in Graph for feasibility 66.60/66.75 Strengthening transition (result): 66.60/66.75 -1 + arg2, arg2 -> 1 + arg2, rest remain the same}> 66.60/66.75 66.60/66.75 Calling reachability with... 66.60/66.75 Transition: 66.60/66.75 Conditions: 2 + arg1 <= arg2, 66.60/66.75 OPEN EXITS: 66.60/66.75 66.60/66.75 66.60/66.75 --- Reachability graph --- 66.60/66.75 > Graph without transitions. 66.60/66.75 66.60/66.75 Calling reachability with... 66.60/66.75 Transition: 66.60/66.75 Conditions: 2 + arg1 <= arg2, 66.60/66.75 OPEN EXITS: 66.60/66.75 66.60/66.75 66.60/66.75 > Conditions are reachable! 66.60/66.75 66.60/66.75 Program does NOT terminate 66.60/66.75 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 66.60/66.75 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 66.60/66.75 EOF