5.93/6.00 NO 5.93/6.00 5.93/6.00 Solver Timeout: 4 5.93/6.00 Global Timeout: 300 5.93/6.00 No parsing errors! 5.93/6.00 Init Location: 0 5.93/6.00 Transitions: 5.93/6.00 5.93/6.00 0) /\ (arg2 > 0) /\ ((arg1 + arg2) < 100), par{arg1 -> arg2, arg2 -> arg1}> 5.93/6.00 17, arg2 -> 13}> 5.93/6.00 undef5, arg2 -> undef6}> 5.93/6.00 5.93/6.00 Fresh variables: 5.93/6.00 undef5, undef6, 5.93/6.00 5.93/6.00 Undef variables: 5.93/6.00 undef5, undef6, 5.93/6.00 5.93/6.00 Abstraction variables: 5.93/6.00 5.93/6.00 Exit nodes: 5.93/6.00 5.93/6.00 Accepting locations: 5.93/6.00 5.93/6.00 Asserts: 5.93/6.00 5.93/6.00 Preprocessed LLVMGraph 5.93/6.00 Init Location: 0 5.93/6.00 Transitions: 5.93/6.00 5.93/6.00 0) /\ (arg2 > 0) /\ ((arg1 + arg2) < 100), par{arg1 -> arg2, arg2 -> arg1}> 5.93/6.00 5.93/6.00 Fresh variables: 5.93/6.00 undef5, undef6, 5.93/6.00 5.93/6.00 Undef variables: 5.93/6.00 undef5, undef6, 5.93/6.00 5.93/6.00 Abstraction variables: 5.93/6.00 5.93/6.00 Exit nodes: 5.93/6.00 5.93/6.00 Accepting locations: 5.93/6.00 5.93/6.00 Asserts: 5.93/6.00 5.93/6.00 ************************************************************* 5.93/6.00 ******************************************************************************************* 5.93/6.00 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.93/6.00 ******************************************************************************************* 5.93/6.00 5.93/6.00 Init Location: 0 5.93/6.00 Graph 0: 5.93/6.00 Transitions: 5.93/6.00 Variables: 5.93/6.00 5.93/6.00 Graph 1: 5.93/6.00 Transitions: 5.93/6.00 arg2, arg2 -> arg1, rest remain the same}> 5.93/6.00 Variables: 5.93/6.00 arg1, arg2 5.93/6.00 5.93/6.00 Precedence: 5.93/6.00 Graph 0 5.93/6.00 5.93/6.00 Graph 1 5.93/6.00 5.93/6.00 5.93/6.00 Map Locations to Subgraph: 5.93/6.00 ( 0 , 0 ) 5.93/6.00 ( 1 , 1 ) 5.93/6.00 5.93/6.00 ******************************************************************************************* 5.93/6.00 ******************************** CHECKING ASSERTIONS ******************************** 5.93/6.00 ******************************************************************************************* 5.93/6.00 5.93/6.00 Proving termination of subgraph 0 5.93/6.00 Proving termination of subgraph 1 5.93/6.00 Checking unfeasibility... 5.93/6.00 Time used: 0.14039 5.93/6.00 5.93/6.00 Checking conditional termination of SCC {l1}... 5.93/6.00 5.93/6.00 LOG: CALL solveLinear 5.93/6.00 5.93/6.00 LOG: RETURN solveLinear - Elapsed time: 0.000849s 5.93/6.00 5.93/6.00 LOG: CALL solveLinear 5.93/6.00 5.93/6.00 LOG: RETURN solveLinear - Elapsed time: 0.002340s 5.93/6.00 Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> 5.93/6.00 Solving with 1 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012144s 5.93/6.00 Time used: 0.011998 5.93/6.00 Solving with 1 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061008s 5.93/6.00 Time used: 0.060689 5.93/6.00 Solving with 2 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002681s 5.93/6.00 Time used: 4.00079 5.93/6.00 Solving with 3 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005399s 5.93/6.00 Time used: 1.00049 5.93/6.00 Solving with 1 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.634063s 5.93/6.00 Time used: 0.630677 5.93/6.00 Termination failed. Trying to show unreachability... 5.93/6.00 Proving unreachability of entry: 5.93/6.00 5.93/6.00 LOG: CALL check - Post:1 <= 0 - Process 1 5.93/6.00 * Exit transition: 5.93/6.00 * Postcondition : 1 <= 0 5.93/6.00 5.93/6.00 LOG: CALL solveLinear 5.93/6.00 5.93/6.00 LOG: RETURN solveLinear - Elapsed time: 0.002104s 5.93/6.00 > Postcondition is not implied! 5.93/6.00 5.93/6.00 LOG: RETURN check - Elapsed time: 0.002216s 5.93/6.00 Cannot prove unreachability 5.93/6.00 5.93/6.00 Proving non-termination of subgraph 1 5.93/6.00 Transitions: 5.93/6.00 arg2, arg2 -> arg1, rest remain the same}> 5.93/6.00 Variables: 5.93/6.00 arg1, arg2 5.93/6.00 5.93/6.00 Checking conditional non-termination of SCC {l1}... 5.93/6.00 EXIT TRANSITIONS: 5.93/6.00 5.93/6.00 5.93/6.00 5.93/6.00 5.93/6.00 5.93/6.00 Solving with 1 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009310s 5.93/6.00 Time used: 0.009105 5.93/6.00 Improving Solution with cost 3 ... 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetNextSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019594s 5.93/6.00 Time used: 0.019587 5.93/6.00 5.93/6.00 LOG: SAT solveNonLinear - Elapsed time: 0.028904s 5.93/6.00 Cost: 3; Total time: 0.028692 5.93/6.00 Non-termination implied by a set of quasi-invariant(s): 5.93/6.00 Quasi-invariant at l1: 1 <= arg2 5.93/6.00 5.93/6.00 Strengthening and disabling EXIT transitions... 5.93/6.00 Closed exits from l1: 2 5.93/6.00 Strengthening exit transition (result): 5.93/6.00 5.93/6.00 Strengthening exit transition (result): 5.93/6.00 5.93/6.00 5.93/6.00 Strengthening and disabling transitions... 5.93/6.00 5.93/6.00 LOG: CALL solverLinear in Graph for feasibility 5.93/6.00 5.93/6.00 LOG: RETURN solveLinear in Graph for feasibility 5.93/6.00 Strengthening transition (result): 5.93/6.00 arg2, arg2 -> arg1, rest remain the same}> 5.93/6.00 5.93/6.00 Checking conditional non-termination of SCC {l1}... 5.93/6.00 EXIT TRANSITIONS: 5.93/6.00 5.93/6.00 5.93/6.00 5.93/6.00 Solving with 1 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005743s 5.93/6.00 Time used: 0.005552 5.93/6.00 Improving Solution with cost 1 ... 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetNextSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009750s 5.93/6.00 Time used: 0.009745 5.93/6.00 5.93/6.00 LOG: SAT solveNonLinear - Elapsed time: 0.015493s 5.93/6.00 Cost: 1; Total time: 0.015297 5.93/6.00 Non-termination implied by a set of quasi-invariant(s): 5.93/6.00 Quasi-invariant at l1: 1 <= arg1 5.93/6.00 5.93/6.00 Strengthening and disabling EXIT transitions... 5.93/6.00 Closed exits from l1: 1 5.93/6.00 Strengthening exit transition (result): 5.93/6.00 5.93/6.00 5.93/6.00 Strengthening and disabling transitions... 5.93/6.00 5.93/6.00 LOG: CALL solverLinear in Graph for feasibility 5.93/6.00 5.93/6.00 LOG: RETURN solveLinear in Graph for feasibility 5.93/6.00 Strengthening transition (result): 5.93/6.00 arg2, arg2 -> arg1, rest remain the same}> 5.93/6.00 5.93/6.00 Checking conditional non-termination of SCC {l1}... 5.93/6.00 EXIT TRANSITIONS: 5.93/6.00 5.93/6.00 5.93/6.00 Solving with 1 template(s). 5.93/6.00 5.93/6.00 LOG: CALL solveNonLinearGetFirstSolution 5.93/6.00 5.93/6.00 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015974s 5.93/6.00 Time used: 0.01587 5.93/6.00 5.93/6.00 LOG: SAT solveNonLinear - Elapsed time: 0.015974s 5.93/6.00 Cost: 0; Total time: 0.01587 5.93/6.00 Non-termination implied by a set of quasi-invariant(s): 5.93/6.00 Quasi-invariant at l1: arg1 + arg2 <= 30 5.93/6.00 5.93/6.00 Strengthening and disabling EXIT transitions... 5.93/6.00 Closed exits from l1: 1 5.93/6.00 5.93/6.00 Strengthening and disabling transitions... 5.93/6.00 5.93/6.00 LOG: CALL solverLinear in Graph for feasibility 5.93/6.00 5.93/6.00 LOG: RETURN solveLinear in Graph for feasibility 5.93/6.00 Strengthening transition (result): 5.93/6.00 arg2, arg2 -> arg1, rest remain the same}> 5.93/6.00 5.93/6.00 Calling reachability with... 5.93/6.00 Transition: 5.93/6.00 Conditions: 1 <= arg2, 1 <= arg1, arg1 + arg2 <= 30, 5.93/6.00 OPEN EXITS: 5.93/6.00 5.93/6.00 5.93/6.00 --- Reachability graph --- 5.93/6.00 > Graph without transitions. 5.93/6.00 5.93/6.00 Calling reachability with... 5.93/6.00 Transition: 5.93/6.00 Conditions: 1 <= arg1, 1 <= arg2, arg1 + arg2 <= 30, 5.93/6.00 OPEN EXITS: 5.93/6.00 5.93/6.00 5.93/6.00 > Conditions are reachable! 5.93/6.00 5.93/6.00 Program does NOT terminate 5.93/6.00 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.93/6.00 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.93/6.00 EOF