5.80/5.81	NO
5.80/5.81	
5.80/5.81	Solver Timeout: 4
5.80/5.81	Global Timeout: 300
5.80/5.81	No parsing errors!
5.80/5.81	Init Location: 0
5.80/5.81	Transitions:
5.80/5.81	<l0, l3, true>
5.80/5.81	<l1, l2, (undef3 > 0) /\ (arg2 > ~(1)) /\ ((undef1 - 1) <= arg1) /\ ((undef2 - 3) <= arg1) /\ (arg1 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}>
5.80/5.81	<l1, l2, ((undef4 - 3) <= arg1) /\ (arg2 > ~(1)) /\ ((undef5 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}>
5.80/5.81	<l2, l2, (arg1 >= undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}>
5.80/5.81	<l2, l2, ((undef10 - 3) <= arg1) /\ ((undef10 - 3) <= arg2) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}>
5.80/5.81	<l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}>
5.80/5.81	
5.80/5.81	Fresh variables:
5.80/5.81	undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 
5.80/5.81	
5.80/5.81	Undef variables:
5.80/5.81	undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 
5.80/5.81	
5.80/5.81	Abstraction variables:
5.80/5.81	
5.80/5.81	Exit nodes:
5.80/5.81	
5.80/5.81	Accepting locations:
5.80/5.81	
5.80/5.81	Asserts:
5.80/5.81	
5.80/5.81	Preprocessed LLVMGraph
5.80/5.81	Init Location: 0
5.80/5.81	Transitions:
5.80/5.81	<l0, l2, (undef3 > 0) /\ (undef14 > ~(1)) /\ ((undef1 - 1) <= undef13) /\ ((undef2 - 3) <= undef13) /\ (undef13 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}>
5.80/5.81	<l0, l2, ((undef4 - 3) <= undef13) /\ (undef14 > ~(1)) /\ ((undef5 - 1) <= undef13) /\ (undef13 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}>
5.80/5.81	<l2, l2, (arg1 >= undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}>
5.80/5.81	<l2, l2, ((undef10 - 3) <= arg1) /\ ((undef10 - 3) <= arg2) /\ (undef11 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}>
5.80/5.81	
5.80/5.81	Fresh variables:
5.80/5.81	undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 
5.80/5.81	
5.80/5.81	Undef variables:
5.80/5.81	undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, 
5.80/5.81	
5.80/5.81	Abstraction variables:
5.80/5.81	
5.80/5.81	Exit nodes:
5.80/5.81	
5.80/5.81	Accepting locations:
5.80/5.81	
5.80/5.81	Asserts:
5.80/5.81	
5.80/5.81	*************************************************************
5.80/5.81	*******************************************************************************************
5.80/5.81	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.80/5.81	*******************************************************************************************
5.80/5.81	
5.80/5.81	Init Location: 0
5.80/5.81	Graph 0:
5.80/5.81	Transitions:
5.80/5.81	Variables:
5.80/5.81	
5.80/5.81	Graph 1:
5.80/5.81	Transitions:
5.80/5.81	<l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	Variables:
5.80/5.81	arg1, arg2, arg3
5.80/5.81	
5.80/5.81	Precedence: 
5.80/5.81	Graph 0
5.80/5.81	
5.80/5.81	Graph 1
5.80/5.81	<l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}>
5.80/5.81	<l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ undef5 <= 1 + undef13 /\ undef4 <= 3 + undef13 /\ 2 <= undef5 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}>
5.80/5.81	
5.80/5.81	Map Locations to Subgraph:
5.80/5.81	( 0 , 0 )
5.80/5.81	( 2 , 1 )
5.80/5.81	
5.80/5.81	*******************************************************************************************
5.80/5.81	********************************    CHECKING ASSERTIONS    ********************************
5.80/5.81	*******************************************************************************************
5.80/5.81	
5.80/5.81	Proving termination of subgraph 0
5.80/5.81	Proving termination of subgraph 1
5.80/5.81	Checking unfeasibility...
5.80/5.81	Time used: 0.009206
5.80/5.81	
5.80/5.81	Checking conditional termination of SCC {l2}...
5.80/5.81	
5.80/5.81	LOG: CALL solveLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear - Elapsed time: 0.002263s
5.80/5.81	
5.80/5.81	LOG: CALL solveLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear - Elapsed time: 0.012811s
5.80/5.81	Trying to remove transition: <l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015274s
5.80/5.81	Time used: 0.014611
5.80/5.81	Trying to remove transition: <l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015541s
5.80/5.81	Time used: 0.014715
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030743s
5.80/5.81	Time used: 0.029761
5.80/5.81	Improving Solution with cost 1 ...
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetNextSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071851s
5.80/5.81	Time used: 0.071842
5.80/5.81	
5.80/5.81	LOG: SAT solveNonLinear - Elapsed time: 0.102594s
5.80/5.81	Cost: 1; Total time: 0.101603
5.80/5.81	Failed at location 2: arg3 <= 0
5.80/5.81	Before Improving: 
5.80/5.81	Quasi-invariant at l2: arg3 <= 0
5.80/5.81	Optimizing invariants...
5.80/5.81	
5.80/5.81	LOG: CALL solveLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear - Elapsed time: 0.009123s
5.80/5.81	Remaining time after improvement: 0.995833
5.80/5.81	Termination implied by a set of quasi-invariant(s):
5.80/5.81	Quasi-invariant at l2: arg3 <= 0
5.80/5.81	[ Invariant Graph ]
5.80/5.81	Strengthening and disabling transitions...
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	It's unfeasible. Removing transition: 
5.80/5.81	<l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	[ Termination Graph ]
5.80/5.81	Strengthening and disabling transitions...
5.80/5.81	> It's unfeasible. Removing transition: 
5.80/5.81	<l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	New Graphs: 
5.80/5.81	Transitions:
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	Variables:
5.80/5.81	arg1, arg2, arg3
5.80/5.81	Checking conditional termination of SCC {l2}...
5.80/5.81	
5.80/5.81	LOG: CALL solveLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear - Elapsed time: 0.001099s
5.80/5.81	
5.80/5.81	LOG: CALL solveLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear - Elapsed time: 0.004342s
5.80/5.81	Trying to remove transition: <l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010821s
5.80/5.81	Time used: 0.010536
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036548s
5.80/5.81	Time used: 0.036002
5.80/5.81	Solving with 2 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002074s
5.80/5.81	Time used: 4.00074
5.80/5.81	Solving with 3 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005303s
5.80/5.81	Time used: 1.00073
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017746s
5.80/5.81	Time used: 0.011861
5.80/5.81	Termination failed. Trying to show unreachability...
5.80/5.81	Proving unreachability of entry: <l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}>
5.80/5.81	
5.80/5.81	LOG: CALL check - Post:1 <= 0 - Process 1
5.80/5.81	* Exit transition: <l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}>
5.80/5.81	* Postcondition  : 1 <= 0
5.80/5.81	
5.80/5.81	LOG: CALL solveLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear - Elapsed time: 0.001559s
5.80/5.81	> Postcondition is not implied!
5.80/5.81	
5.80/5.81	LOG: RETURN check - Elapsed time: 0.001701s
5.80/5.81	Cannot prove unreachability
5.80/5.81	
5.80/5.81	Proving non-termination of subgraph 1
5.80/5.81	Transitions:
5.80/5.81	<l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	Variables:
5.80/5.81	arg1, arg2, arg3
5.80/5.81	
5.80/5.81	Checking that every undef value has an assignment...
5.80/5.81	
5.80/5.81	LOG: CALL solveLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear - Elapsed time: 0.003327s
5.80/5.81	Checking conditional non-termination of SCC {l2}...
5.80/5.81	EXIT TRANSITIONS:
5.80/5.81	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
5.80/5.81	<l2, end, arg2 <= 0 /\ 1 <= arg1 /\ 1 <= arg3, {all remain the same}>
5.80/5.81	<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ 1 <= arg1, {all remain the same}>
5.80/5.81	<l2, end, arg1 <= 0 /\ 1 <= arg3, {all remain the same}>
5.80/5.81	<l2, end, arg1 <= 0 /\ arg3 <= 0, {all remain the same}>
5.80/5.81	
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106786s
5.80/5.81	Time used: 0.105987
5.80/5.81	Improving Solution with cost 3 ...
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetNextSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074105s
5.80/5.81	Time used: 0.074097
5.80/5.81	
5.80/5.81	LOG: SAT solveNonLinear - Elapsed time: 0.180891s
5.80/5.81	Cost: 3; Total time: 0.180084
5.80/5.81	Minimizing number of undef constraints...
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinear - Elapsed time: 0.014439s
5.80/5.81	Number of undef constraints reduced!
5.80/5.81	
5.80/5.81	Non-termination implied by a set of quasi-invariant(s):
5.80/5.81	Quasi-invariant at l2: 1 <= arg1
5.80/5.81	
5.80/5.81	Strengthening and disabling EXIT transitions...
5.80/5.81	Closed exits from l2: 2
5.80/5.81	Strengthening exit transition (result): 
5.80/5.81	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
5.80/5.81	Strengthening exit transition (result): 
5.80/5.81	<l2, end, arg2 <= 0 /\ 1 <= arg1 /\ 1 <= arg3, {all remain the same}>
5.80/5.81	Strengthening exit transition (result): 
5.80/5.81	<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ 1 <= arg1, {all remain the same}>
5.80/5.81	
5.80/5.81	Strengthening and disabling transitions...
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	
5.80/5.81	Checking conditional non-termination of SCC {l2}...
5.80/5.81	EXIT TRANSITIONS:
5.80/5.81	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
5.80/5.81	<l2, end, arg2 <= 0 /\ 1 <= arg1 /\ 1 <= arg3, {all remain the same}>
5.80/5.81	<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ 1 <= arg1, {all remain the same}>
5.80/5.81	
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058707s
5.80/5.81	Time used: 0.057938
5.80/5.81	Improving Solution with cost 1 ...
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetNextSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.107408s
5.80/5.81	Time used: 0.107398
5.80/5.81	
5.80/5.81	LOG: SAT solveNonLinear - Elapsed time: 0.166115s
5.80/5.81	Cost: 1; Total time: 0.165336
5.80/5.81	Minimizing number of undef constraints...
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinear - Elapsed time: 0.014372s
5.80/5.81	Number of undef constraints reduced!
5.80/5.81	
5.80/5.81	Non-termination implied by a set of quasi-invariant(s):
5.80/5.81	Quasi-invariant at l2: 1 <= arg2
5.80/5.81	
5.80/5.81	Strengthening and disabling EXIT transitions...
5.80/5.81	Closed exits from l2: 2
5.80/5.81	Strengthening exit transition (result): 
5.80/5.81	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
5.80/5.81	
5.80/5.81	Strengthening and disabling transitions...
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	
5.80/5.81	Checking conditional non-termination of SCC {l2}...
5.80/5.81	EXIT TRANSITIONS:
5.80/5.81	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
5.80/5.81	
5.80/5.81	Solving with 1 template(s).
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinearGetFirstSolution
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061331s
5.80/5.81	Time used: 0.061183
5.80/5.81	
5.80/5.81	LOG: SAT solveNonLinear - Elapsed time: 0.061331s
5.80/5.81	Cost: 0; Total time: 0.061183
5.80/5.81	Minimizing number of undef constraints...
5.80/5.81	
5.80/5.81	LOG: CALL solveNonLinear
5.80/5.81	
5.80/5.81	LOG: RETURN solveNonLinear - Elapsed time: 0.017547s
5.80/5.81	Number of undef constraints reduced!
5.80/5.81	
5.80/5.81	Non-termination implied by a set of quasi-invariant(s):
5.80/5.81	Quasi-invariant at l2: 0 <= arg3
5.80/5.81	
5.80/5.81	Strengthening and disabling EXIT transitions...
5.80/5.81	Closed exits from l2: 1
5.80/5.81	
5.80/5.81	Strengthening and disabling transitions...
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef7 <= arg1 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef7 /\ undef8 <= 3 + arg1 /\ undef8 <= 3 + arg2 /\ 4 <= undef8, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
5.80/5.81	
5.80/5.81	LOG: CALL solverLinear in Graph for feasibility
5.80/5.81	
5.80/5.81	LOG: RETURN solveLinear in Graph for feasibility
5.80/5.81	Strengthening transition (result): 
5.80/5.81	<l2, l2, undef11 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef11 /\ undef10 <= 3 + arg1 /\ undef10 <= 3 + arg2 /\ 4 <= undef10 /\ arg3 = 0, {arg1 -> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}>
5.80/5.81	
5.80/5.81	Calling reachability with...
5.80/5.81	Transition: <l2, end, true, {all remain the same}>
5.80/5.81	Conditions: 1 <= arg1, 1 <= arg2, 0 <= arg3, 
5.80/5.81	Transition: <l2, end, true, {all remain the same}>
5.80/5.81	Conditions: 1 <= arg1, 1 <= arg2, 0 <= arg3, 
5.80/5.81	OPEN EXITS: 
5.80/5.81	<l2, end, 0 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
5.80/5.81	<l2, end, 0 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
5.80/5.81	
5.80/5.81	--- Reachability graph ---
5.80/5.81	> Graph without transitions.
5.80/5.81	
5.80/5.81	Calling reachability with...
5.80/5.81	Transition: <l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}>
5.80/5.81	Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, 
5.80/5.81	Transition: <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ undef5 <= 1 + undef13 /\ undef4 <= 3 + undef13 /\ 2 <= undef5 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}>
5.80/5.81	Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, 
5.80/5.81	Transition: <l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}>
5.80/5.81	Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, 
5.80/5.81	Transition: <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ undef5 <= 1 + undef13 /\ undef4 <= 3 + undef13 /\ 2 <= undef5 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}>
5.80/5.81	Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, 
5.80/5.81	OPEN EXITS: 
5.80/5.81	<l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}>
5.80/5.81	<l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ undef5 <= 1 + undef13 /\ undef4 <= 3 + undef13 /\ 2 <= undef5 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}>
5.80/5.81	<l0, l2, 0 <= undef14 /\ 1 <= undef3 /\ 1 <= undef13 /\ undef1 <= 1 + undef13 /\ undef2 <= 3 + undef13 /\ 2 <= undef1 /\ 4 <= undef2, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}>
5.80/5.81	<l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ undef5 <= 1 + undef13 /\ undef4 <= 3 + undef13 /\ 2 <= undef5 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}>
5.80/5.81	
5.80/5.81	> Conditions are reachable!
5.80/5.81	
5.80/5.81	Program does NOT terminate
5.80/5.81	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.80/5.81	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.80/5.81	EOF