63.54/63.69 NO 63.54/63.69 63.54/63.69 Solver Timeout: 4 63.54/63.69 Global Timeout: 300 63.54/63.69 No parsing errors! 63.54/63.69 Init Location: 0 63.54/63.69 Transitions: 63.54/63.69 63.54/63.69 (1 + i^0), j^0 -> (2 + j^0), ret_pair5^0 -> undef3}> 63.54/63.69 63.54/63.69 63.54/63.69 0, j^0 -> 0}> 63.54/63.69 63.54/63.69 63.54/63.69 Fresh variables: 63.54/63.69 undef3, 63.54/63.69 63.54/63.69 Undef variables: 63.54/63.69 undef3, 63.54/63.69 63.54/63.69 Abstraction variables: 63.54/63.69 63.54/63.69 Exit nodes: 63.54/63.69 63.54/63.69 Accepting locations: 63.54/63.69 63.54/63.69 Asserts: 63.54/63.69 63.54/63.69 Preprocessed LLVMGraph 63.54/63.69 Init Location: 0 63.54/63.69 Transitions: 63.54/63.69 63.54/63.69 (1 + i^0), j^0 -> (2 + j^0)}> 63.54/63.69 63.54/63.69 63.54/63.69 Fresh variables: 63.54/63.69 undef3, 63.54/63.69 63.54/63.69 Undef variables: 63.54/63.69 undef3, 63.54/63.69 63.54/63.69 Abstraction variables: 63.54/63.69 63.54/63.69 Exit nodes: 63.54/63.69 63.54/63.69 Accepting locations: 63.54/63.69 63.54/63.69 Asserts: 63.54/63.69 63.54/63.69 ************************************************************* 63.54/63.69 ******************************************************************************************* 63.54/63.69 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 63.54/63.69 ******************************************************************************************* 63.54/63.69 63.54/63.69 Init Location: 0 63.54/63.69 Graph 0: 63.54/63.69 Transitions: 63.54/63.69 Variables: 63.54/63.69 63.54/63.69 Graph 1: 63.54/63.69 Transitions: 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Variables: 63.54/63.69 i^0, j^0 63.54/63.69 63.54/63.69 Graph 2: 63.54/63.69 Transitions: 63.54/63.69 Variables: 63.54/63.69 63.54/63.69 Precedence: 63.54/63.69 Graph 0 63.54/63.69 63.54/63.69 Graph 1 63.54/63.69 63.54/63.69 63.54/63.69 Graph 2 63.54/63.69 63.54/63.69 63.54/63.69 Map Locations to Subgraph: 63.54/63.69 ( 0 , 0 ) 63.54/63.69 ( 2 , 1 ) 63.54/63.69 ( 3 , 2 ) 63.54/63.69 63.54/63.69 ******************************************************************************************* 63.54/63.69 ******************************** CHECKING ASSERTIONS ******************************** 63.54/63.69 ******************************************************************************************* 63.54/63.69 63.54/63.69 Proving termination of subgraph 0 63.54/63.69 Proving termination of subgraph 1 63.54/63.69 Checking unfeasibility... 63.54/63.69 Time used: 0.002184 63.54/63.69 63.54/63.69 Checking conditional termination of SCC {l2}... 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.000403s 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.001000s 63.54/63.69 Trying to remove transition: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006046s 63.54/63.69 Time used: 0.005932 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000832s 63.54/63.69 Time used: 4.00042 63.54/63.69 Solving with 2 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.019403s 63.54/63.69 Time used: 4.00072 63.54/63.69 Solving with 3 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009367s 63.54/63.69 Time used: 1.00042 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015229s 63.54/63.69 Time used: 0.009482 63.54/63.69 Improving Solution with cost 1 ... 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetNextSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000639s 63.54/63.69 Time used: 1.00069 63.54/63.69 63.54/63.69 LOG: SAT solveNonLinear - Elapsed time: 1.015868s 63.54/63.69 Cost: 1; Total time: 1.01017 63.54/63.69 Quasi-ranking function: 50000 - i^0 63.54/63.69 New Graphs: 63.54/63.69 Transitions: 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Variables: 63.54/63.69 i^0, j^0 63.54/63.69 Checking conditional termination of SCC {l2}... 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.000512s 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.001655s 63.54/63.69 Trying to remove transition: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009138s 63.54/63.69 Time used: 0.009009 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001450s 63.54/63.69 Time used: 4.00094 63.54/63.69 Solving with 2 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007134s 63.54/63.69 Time used: 4.00074 63.54/63.69 Solving with 3 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007625s 63.54/63.69 Time used: 1.00048 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016041s 63.54/63.69 Time used: 0.010004 63.54/63.69 Improving Solution with cost 1 ... 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetNextSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001427s 63.54/63.69 Time used: 1.0009 63.54/63.69 63.54/63.69 LOG: SAT solveNonLinear - Elapsed time: 1.017468s 63.54/63.69 Cost: 1; Total time: 1.0109 63.54/63.69 Termination implied by a set of invariant(s): 63.54/63.69 Invariant at l2: 0 <= 1 + i^0 + j^0 63.54/63.69 [ Invariant Graph ] 63.54/63.69 Strengthening and disabling transitions... 63.54/63.69 63.54/63.69 LOG: CALL solverLinear in Graph for feasibility 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear in Graph for feasibility 63.54/63.69 Strengthening transition (result): 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 [ Termination Graph ] 63.54/63.69 Strengthening and disabling transitions... 63.54/63.69 63.54/63.69 LOG: CALL solverLinear in Graph for feasibility 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear in Graph for feasibility 63.54/63.69 Strengthening transition (result): 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Quasi-ranking function: 50000 - j^0 63.54/63.69 New Graphs: 63.54/63.69 Transitions: 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Variables: 63.54/63.69 i^0, j^0 63.54/63.69 Checking conditional termination of SCC {l2}... 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.000676s 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.003637s 63.54/63.69 Trying to remove transition: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010879s 63.54/63.69 Time used: 0.010719 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002102s 63.54/63.69 Time used: 4.00173 63.54/63.69 Solving with 2 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007908s 63.54/63.69 Time used: 4.00097 63.54/63.69 Solving with 3 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016497s 63.54/63.69 Time used: 1.00865 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019285s 63.54/63.69 Time used: 0.013052 63.54/63.69 Improving Solution with cost 1 ... 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetNextSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001507s 63.54/63.69 Time used: 1.00104 63.54/63.69 63.54/63.69 LOG: SAT solveNonLinear - Elapsed time: 1.020792s 63.54/63.69 Cost: 1; Total time: 1.01409 63.54/63.69 Termination implied by a set of invariant(s): 63.54/63.69 Invariant at l2: i^0 <= 1 + j^0 63.54/63.69 [ Invariant Graph ] 63.54/63.69 Strengthening and disabling transitions... 63.54/63.69 63.54/63.69 LOG: CALL solverLinear in Graph for feasibility 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear in Graph for feasibility 63.54/63.69 Strengthening transition (result): 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 [ Termination Graph ] 63.54/63.69 Strengthening and disabling transitions... 63.54/63.69 63.54/63.69 LOG: CALL solverLinear in Graph for feasibility 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear in Graph for feasibility 63.54/63.69 Strengthening transition (result): 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Quasi-ranking function: 50000 + i^0 - j^0 63.54/63.69 New Graphs: 63.54/63.69 Transitions: 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Variables: 63.54/63.69 i^0, j^0 63.54/63.69 Checking conditional termination of SCC {l2}... 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.000809s 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.005448s 63.54/63.69 Trying to remove transition: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029003s 63.54/63.69 Time used: 0.028826 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012867s 63.54/63.69 Time used: 4.01247 63.54/63.69 Solving with 2 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007824s 63.54/63.69 Time used: 4.00193 63.54/63.69 Solving with 3 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010143s 63.54/63.69 Time used: 1.00243 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018584s 63.54/63.69 Time used: 0.014001 63.54/63.69 Improving Solution with cost 1 ... 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetNextSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000834s 63.54/63.69 Time used: 1.00086 63.54/63.69 63.54/63.69 LOG: SAT solveNonLinear - Elapsed time: 1.019419s 63.54/63.69 Cost: 1; Total time: 1.01486 63.54/63.69 Termination implied by a set of invariant(s): 63.54/63.69 Invariant at l2: 0 <= i^0 63.54/63.69 [ Invariant Graph ] 63.54/63.69 Strengthening and disabling transitions... 63.54/63.69 63.54/63.69 LOG: CALL solverLinear in Graph for feasibility 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear in Graph for feasibility 63.54/63.69 Strengthening transition (result): 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 [ Termination Graph ] 63.54/63.69 Strengthening and disabling transitions... 63.54/63.69 63.54/63.69 LOG: CALL solverLinear in Graph for feasibility 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear in Graph for feasibility 63.54/63.69 Strengthening transition (result): 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Quasi-ranking function: 50000 - 3*i^0 + j^0 63.54/63.69 New Graphs: 63.54/63.69 Transitions: 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Variables: 63.54/63.69 i^0, j^0 63.54/63.69 Checking conditional termination of SCC {l2}... 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.000918s 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.004658s 63.54/63.69 Trying to remove transition: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045027s 63.54/63.69 Time used: 0.044847 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001633s 63.54/63.69 Time used: 4.00127 63.54/63.69 Solving with 2 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007082s 63.54/63.69 Time used: 4.00094 63.54/63.69 Solving with 3 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007296s 63.54/63.69 Time used: 1.00056 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018877s 63.54/63.69 Time used: 0.013473 63.54/63.69 Improving Solution with cost 1 ... 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetNextSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002067s 63.54/63.69 Time used: 1.00107 63.54/63.69 63.54/63.69 LOG: SAT solveNonLinear - Elapsed time: 1.020944s 63.54/63.69 Cost: 1; Total time: 1.01454 63.54/63.69 Quasi-ranking function: 50000 - i^0 - j^0 63.54/63.69 New Graphs: 63.54/63.69 Transitions: 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Variables: 63.54/63.69 i^0, j^0 63.54/63.69 Checking conditional termination of SCC {l2}... 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.000913s 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.003914s 63.54/63.69 Trying to remove transition: 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045196s 63.54/63.69 Time used: 0.045017 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002443s 63.54/63.69 Time used: 4.00175 63.54/63.69 Solving with 2 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007674s 63.54/63.69 Time used: 4.00107 63.54/63.69 Solving with 3 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016040s 63.54/63.69 Time used: 1.00898 63.54/63.69 Solving with 1 template(s). 63.54/63.69 63.54/63.69 LOG: CALL solveNonLinearGetFirstSolution 63.54/63.69 63.54/63.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007206s 63.54/63.69 Time used: 4.00181 63.54/63.69 Termination failed. Trying to show unreachability... 63.54/63.69 Proving unreachability of entry: 63.54/63.69 63.54/63.69 LOG: CALL check - Post:1 <= 0 - Process 1 63.54/63.69 * Exit transition: 63.54/63.69 * Postcondition : 1 <= 0 63.54/63.69 63.54/63.69 LOG: CALL solveLinear 63.54/63.69 63.54/63.69 LOG: RETURN solveLinear - Elapsed time: 0.007075s 63.54/63.69 > Postcondition is not implied! 63.54/63.69 63.54/63.69 LOG: RETURN check - Elapsed time: 0.007199s 63.54/63.69 Cannot prove unreachability 63.54/63.69 63.54/63.69 Proving non-termination of subgraph 1 63.54/63.69 Transitions: 63.54/63.69 1 + i^0, j^0 -> 2 + j^0, rest remain the same}> 63.54/63.69 Variables: 63.54/63.69 i^0, j^0 63.54/63.69 63.54/63.69 Checking conditional non-termination of SCC {l2}... 63.54/63.69 > No exit transition to close. 63.54/63.69 Calling reachability with... 63.54/63.69 Transition: 63.54/63.69 Conditions: 63.54/63.69 OPEN EXITS: 63.54/63.69 63.54/63.69 63.54/63.69 --- Reachability graph --- 63.54/63.69 > Graph without transitions. 63.54/63.69 63.54/63.69 Calling reachability with... 63.54/63.69 Transition: 63.54/63.69 Conditions: 63.54/63.69 OPEN EXITS: 63.54/63.69 63.54/63.69 63.54/63.69 > Conditions are reachable! 63.54/63.69 63.54/63.69 Program does NOT terminate 63.54/63.69 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 63.54/63.69 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 63.54/63.69 EOF