5.56/5.59 NO 5.56/5.59 5.56/5.59 Solver Timeout: 4 5.56/5.59 Global Timeout: 300 5.56/5.59 No parsing errors! 5.56/5.59 Init Location: 0 5.56/5.59 Transitions: 5.56/5.59 5.56/5.59 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = arg2), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 2}> 5.56/5.59 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = arg2), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 1}> 5.56/5.59 = undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 5.56/5.59 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> 5.56/5.59 undef13, arg2 -> undef14, arg3 -> undef15}> 5.56/5.59 5.56/5.59 Fresh variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Undef variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Abstraction variables: 5.56/5.59 5.56/5.59 Exit nodes: 5.56/5.59 5.56/5.59 Accepting locations: 5.56/5.59 5.56/5.59 Asserts: 5.56/5.59 5.56/5.59 Preprocessed LLVMGraph 5.56/5.59 Init Location: 0 5.56/5.59 Transitions: 5.56/5.59 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = undef14), par{arg1 -> undef1, arg2 -> undef2}> 5.56/5.59 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = undef14), par{arg1 -> undef4, arg2 -> undef5}> 5.56/5.59 = undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 5.56/5.59 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> 5.56/5.59 5.56/5.59 Fresh variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Undef variables: 5.56/5.59 undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 5.56/5.59 5.56/5.59 Abstraction variables: 5.56/5.59 5.56/5.59 Exit nodes: 5.56/5.59 5.56/5.59 Accepting locations: 5.56/5.59 5.56/5.59 Asserts: 5.56/5.59 5.56/5.59 ************************************************************* 5.56/5.59 ******************************************************************************************* 5.56/5.59 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.56/5.59 ******************************************************************************************* 5.56/5.59 5.56/5.59 Init Location: 0 5.56/5.59 Graph 0: 5.56/5.59 Transitions: 5.56/5.59 Variables: 5.56/5.59 5.56/5.59 Graph 1: 5.56/5.59 Transitions: 5.56/5.59 undef7, arg2 -> undef8, rest remain the same}> 5.56/5.59 undef10, arg2 -> undef11, rest remain the same}> 5.56/5.59 Variables: 5.56/5.59 arg1, arg2 5.56/5.59 5.56/5.59 Precedence: 5.56/5.59 Graph 0 5.56/5.59 5.56/5.59 Graph 1 5.56/5.59 undef1, arg2 -> undef2, rest remain the same}> 5.56/5.59 undef4, arg2 -> undef5, rest remain the same}> 5.56/5.59 5.56/5.59 Map Locations to Subgraph: 5.56/5.59 ( 0 , 0 ) 5.56/5.59 ( 2 , 1 ) 5.56/5.59 5.56/5.59 ******************************************************************************************* 5.56/5.59 ******************************** CHECKING ASSERTIONS ******************************** 5.56/5.59 ******************************************************************************************* 5.56/5.59 5.56/5.59 Proving termination of subgraph 0 5.56/5.59 Proving termination of subgraph 1 5.56/5.59 Checking unfeasibility... 5.56/5.59 Time used: 0.006524 5.56/5.59 5.56/5.59 Checking conditional termination of SCC {l2}... 5.56/5.59 5.56/5.59 LOG: CALL solveLinear 5.56/5.59 5.56/5.59 LOG: RETURN solveLinear - Elapsed time: 0.001896s 5.56/5.59 5.56/5.59 LOG: CALL solveLinear 5.56/5.59 5.56/5.59 LOG: RETURN solveLinear - Elapsed time: 0.010600s 5.56/5.59 Trying to remove transition: undef10, arg2 -> undef11, rest remain the same}> 5.56/5.60 Solving with 1 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011074s 5.56/5.60 Time used: 0.010492 5.56/5.60 Trying to remove transition: undef7, arg2 -> undef8, rest remain the same}> 5.56/5.60 Solving with 1 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010853s 5.56/5.60 Time used: 0.010226 5.56/5.60 Solving with 1 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027590s 5.56/5.60 Time used: 0.026964 5.56/5.60 Solving with 2 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003694s 5.56/5.60 Time used: 4.00078 5.56/5.60 Solving with 3 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006754s 5.56/5.60 Time used: 1.00052 5.56/5.60 Solving with 1 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025242s 5.56/5.60 Time used: 0.016779 5.56/5.60 Termination failed. Trying to show unreachability... 5.56/5.60 Proving unreachability of entry: undef1, arg2 -> undef2, rest remain the same}> 5.56/5.60 5.56/5.60 LOG: CALL check - Post:1 <= 0 - Process 1 5.56/5.60 * Exit transition: undef1, arg2 -> undef2, rest remain the same}> 5.56/5.60 * Postcondition : 1 <= 0 5.56/5.60 5.56/5.60 LOG: CALL solveLinear 5.56/5.60 5.56/5.60 LOG: RETURN solveLinear - Elapsed time: 0.001776s 5.56/5.60 > Postcondition is not implied! 5.56/5.60 5.56/5.60 LOG: RETURN check - Elapsed time: 0.001923s 5.56/5.60 Cannot prove unreachability 5.56/5.60 5.56/5.60 Proving non-termination of subgraph 1 5.56/5.60 Transitions: 5.56/5.60 undef7, arg2 -> undef8, rest remain the same}> 5.56/5.60 undef10, arg2 -> undef11, rest remain the same}> 5.56/5.60 Variables: 5.56/5.60 arg1, arg2 5.56/5.60 5.56/5.60 Checking that every undef value has an assignment... 5.56/5.60 5.56/5.60 LOG: CALL solveLinear 5.56/5.60 5.56/5.60 LOG: RETURN solveLinear - Elapsed time: 0.003062s 5.56/5.60 Checking conditional non-termination of SCC {l2}... 5.56/5.60 EXIT TRANSITIONS: 5.56/5.60 5.56/5.60 5.56/5.60 5.56/5.60 Solving with 1 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048940s 5.56/5.60 Time used: 0.048019 5.56/5.60 Improving Solution with cost 1 ... 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetNextSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.229310s 5.56/5.60 Time used: 0.229037 5.56/5.60 5.56/5.60 LOG: SAT solveNonLinear - Elapsed time: 0.278250s 5.56/5.60 Cost: 1; Total time: 0.277056 5.56/5.60 Minimizing number of undef constraints... 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinear 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinear - Elapsed time: 0.040577s 5.56/5.60 Number of undef constraints reduced! 5.56/5.60 5.56/5.60 Non-termination implied by a set of quasi-invariant(s): 5.56/5.60 Quasi-invariant at l2: 1 <= arg1 5.56/5.60 5.56/5.60 Strengthening and disabling EXIT transitions... 5.56/5.60 Closed exits from l2: 1 5.56/5.60 Strengthening exit transition (result): 5.56/5.60 5.56/5.60 5.56/5.60 Strengthening and disabling transitions... 5.56/5.60 5.56/5.60 LOG: CALL solverLinear in Graph for feasibility 5.56/5.60 5.56/5.60 LOG: RETURN solveLinear in Graph for feasibility 5.56/5.60 Strengthening transition (result): 5.56/5.60 undef7, arg2 -> undef8, rest remain the same}> 5.56/5.60 5.56/5.60 LOG: CALL solverLinear in Graph for feasibility 5.56/5.60 5.56/5.60 LOG: RETURN solveLinear in Graph for feasibility 5.56/5.60 Strengthening transition (result): 5.56/5.60 undef10, arg2 -> undef11, rest remain the same}> 5.56/5.60 5.56/5.60 Checking conditional non-termination of SCC {l2}... 5.56/5.60 EXIT TRANSITIONS: 5.56/5.60 5.56/5.60 5.56/5.60 Solving with 1 template(s). 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinearGetFirstSolution 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039610s 5.56/5.60 Time used: 0.039501 5.56/5.60 5.56/5.60 LOG: SAT solveNonLinear - Elapsed time: 0.039610s 5.56/5.60 Cost: 0; Total time: 0.039501 5.56/5.60 Minimizing number of undef constraints... 5.56/5.60 5.56/5.60 LOG: CALL solveNonLinear 5.56/5.60 5.56/5.60 LOG: RETURN solveNonLinear - Elapsed time: 0.014626s 5.56/5.60 Number of undef constraints reduced! 5.56/5.60 5.56/5.60 Non-termination implied by a set of quasi-invariant(s): 5.56/5.60 Quasi-invariant at l2: 1 <= arg2 5.56/5.60 5.56/5.60 Strengthening and disabling EXIT transitions... 5.56/5.60 Closed exits from l2: 1 5.56/5.60 5.56/5.60 Strengthening and disabling transitions... 5.56/5.60 5.56/5.60 LOG: CALL solverLinear in Graph for feasibility 5.56/5.60 5.56/5.60 LOG: RETURN solveLinear in Graph for feasibility 5.56/5.60 Strengthening transition (result): 5.56/5.60 undef7, arg2 -> undef8, rest remain the same}> 5.56/5.60 5.56/5.60 LOG: CALL solverLinear in Graph for feasibility 5.56/5.60 5.56/5.60 LOG: RETURN solveLinear in Graph for feasibility 5.56/5.60 Strengthening transition (result): 5.56/5.60 undef10, arg2 -> undef11, rest remain the same}> 5.56/5.60 5.56/5.60 Calling reachability with... 5.56/5.60 Transition: 5.56/5.60 Conditions: 1 <= arg1, 1 <= arg2, 5.56/5.60 Transition: 5.56/5.60 Conditions: 1 <= arg1, 1 <= arg2, 5.56/5.60 OPEN EXITS: 5.56/5.60 5.56/5.60 5.56/5.60 5.56/5.60 --- Reachability graph --- 5.56/5.60 > Graph without transitions. 5.56/5.60 5.56/5.60 Calling reachability with... 5.56/5.60 Transition: undef1, arg2 -> undef2, rest remain the same}> 5.56/5.60 Conditions: 1 <= arg1, 1 <= arg2, 5.56/5.60 Transition: undef4, arg2 -> undef5, rest remain the same}> 5.56/5.60 Conditions: 1 <= arg1, 1 <= arg2, 5.56/5.60 Transition: undef1, arg2 -> undef2, rest remain the same}> 5.56/5.60 Conditions: 1 <= arg1, 1 <= arg2, 5.56/5.60 Transition: undef4, arg2 -> undef5, rest remain the same}> 5.56/5.60 Conditions: 1 <= arg1, 1 <= arg2, 5.56/5.60 OPEN EXITS: 5.56/5.60 undef1, arg2 -> undef2, rest remain the same}> 5.56/5.60 undef4, arg2 -> undef5, rest remain the same}> 5.56/5.60 undef1, arg2 -> undef2, rest remain the same}> 5.56/5.60 undef4, arg2 -> undef5, rest remain the same}> 5.56/5.60 5.56/5.60 > Conditions are reachable! 5.56/5.60 5.56/5.60 Program does NOT terminate 5.56/5.60 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.56/5.60 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.56/5.60 EOF