54.61/54.75	NO
54.61/54.75	
54.61/54.75	Solver Timeout: 4
54.61/54.75	Global Timeout: 300
54.61/54.75	No parsing errors!
54.61/54.75	Init Location: 0
54.61/54.75	Transitions:
54.61/54.75	<l0, l3, true>
54.61/54.75	<l1, l2, (0 >= (~(1) * arg2)) /\ (arg2 > ~(1)) /\ (2 > (~(1) * arg2)) /\ (1 > (~(1) * arg2)) /\ (arg1 > 0), par{arg1 -> ((~(1) * arg2) - 1), arg2 -> ((~(1) * arg2) - 2)}>
54.61/54.75	<l2, l2, (arg2 < 1) /\ (arg2 < 0) /\ (arg2 < arg1) /\ (arg1 < 1), par{arg1 -> arg2, arg2 -> (arg2 - 1)}>
54.61/54.75	<l3, l1, true, par{arg1 -> undef5, arg2 -> undef6}>
54.61/54.75	
54.61/54.75	Fresh variables:
54.61/54.75	undef5, undef6, 
54.61/54.75	
54.61/54.75	Undef variables:
54.61/54.75	undef5, undef6, 
54.61/54.75	
54.61/54.75	Abstraction variables:
54.61/54.75	
54.61/54.75	Exit nodes:
54.61/54.75	
54.61/54.75	Accepting locations:
54.61/54.75	
54.61/54.75	Asserts:
54.61/54.75	
54.61/54.75	Preprocessed LLVMGraph
54.61/54.75	Init Location: 0
54.61/54.75	Transitions:
54.61/54.75	<l0, l2, (arg1 = ((~(1) * undef6) - 1)) /\ (arg2 = ((~(1) * undef6) - 2)) /\ (0 >= (~(1) * undef6)) /\ (undef6 > ~(1)) /\ (2 > (~(1) * undef6)) /\ (1 > (~(1) * undef6)) /\ (undef5 > 0)>
54.61/54.75	<l2, l2, (arg2 < 1) /\ (arg2 < 0) /\ (arg2 < arg1) /\ (arg1 < 1), par{arg1 -> arg2, arg2 -> (arg2 - 1)}>
54.61/54.75	
54.61/54.75	Fresh variables:
54.61/54.75	undef5, undef6, 
54.61/54.75	
54.61/54.75	Undef variables:
54.61/54.75	undef5, undef6, 
54.61/54.75	
54.61/54.75	Abstraction variables:
54.61/54.75	
54.61/54.75	Exit nodes:
54.61/54.75	
54.61/54.75	Accepting locations:
54.61/54.75	
54.61/54.75	Asserts:
54.61/54.75	
54.61/54.75	*************************************************************
54.61/54.75	*******************************************************************************************
54.61/54.75	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
54.61/54.75	*******************************************************************************************
54.61/54.75	
54.61/54.75	Init Location: 0
54.61/54.75	Graph 0:
54.61/54.75	Transitions:
54.61/54.75	Variables:
54.61/54.75	
54.61/54.75	Graph 1:
54.61/54.75	Transitions:
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Variables:
54.61/54.75	arg1, arg2
54.61/54.75	
54.61/54.75	Precedence: 
54.61/54.75	Graph 0
54.61/54.75	
54.61/54.75	Graph 1
54.61/54.75	<l0, l2, 0 <= undef6 /\ 1 <= undef5 /\ 1 + arg1 + undef6 = 0 /\ 2 + arg2 + undef6 = 0, {all remain the same}>
54.61/54.75	
54.61/54.75	Map Locations to Subgraph:
54.61/54.75	( 0 , 0 )
54.61/54.75	( 2 , 1 )
54.61/54.75	
54.61/54.75	*******************************************************************************************
54.61/54.75	********************************    CHECKING ASSERTIONS    ********************************
54.61/54.75	*******************************************************************************************
54.61/54.75	
54.61/54.75	Proving termination of subgraph 0
54.61/54.75	Proving termination of subgraph 1
54.61/54.75	Checking unfeasibility...
54.61/54.75	Time used: 0.002605
54.61/54.75	
54.61/54.75	Checking conditional termination of SCC {l2}...
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.000657s
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.002139s
54.61/54.75	Trying to remove transition: <l2, l2, arg1 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006003s
54.61/54.75	Time used: 0.005835
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001441s
54.61/54.75	Time used: 4.00066
54.61/54.75	Solving with 2 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005002s
54.61/54.75	Time used: 4.00059
54.61/54.75	Solving with 3 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008900s
54.61/54.75	Time used: 1.00038
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010902s
54.61/54.75	Time used: 0.007518
54.61/54.75	Improving Solution with cost 1 ...
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetNextSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020544s
54.61/54.75	Time used: 0.020526
54.61/54.75	
54.61/54.75	LOG: SAT solveNonLinear - Elapsed time: 0.031447s
54.61/54.75	Cost: 1; Total time: 0.028044
54.61/54.75	Termination implied by a set of invariant(s):
54.61/54.75	Invariant at l2: arg1 <= 1
54.61/54.75	[ Invariant Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	[ Termination Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Quasi-ranking function: 50000 + arg1
54.61/54.75	New Graphs: 
54.61/54.75	Transitions:
54.61/54.75	<l2, l2, 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Variables:
54.61/54.75	arg1, arg2
54.61/54.75	Checking conditional termination of SCC {l2}...
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.000616s
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.002531s
54.61/54.75	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006344s
54.61/54.75	Time used: 0.006191
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000769s
54.61/54.75	Time used: 4.00003
54.61/54.75	Solving with 2 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014811s
54.61/54.75	Time used: 4.00069
54.61/54.75	Solving with 3 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005962s
54.61/54.75	Time used: 1.00037
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012731s
54.61/54.75	Time used: 0.009328
54.61/54.75	Improving Solution with cost 1 ...
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetNextSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023739s
54.61/54.75	Time used: 0.023733
54.61/54.75	
54.61/54.75	LOG: SAT solveNonLinear - Elapsed time: 0.036469s
54.61/54.75	Cost: 1; Total time: 0.033061
54.61/54.75	Termination implied by a set of invariant(s):
54.61/54.75	Invariant at l2: 1 + arg1 + arg2 <= 0
54.61/54.75	[ Invariant Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg1 + arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	[ Termination Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, 1 + arg1 + arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Quasi-ranking function: 50000 + arg1 + arg2
54.61/54.75	New Graphs: 
54.61/54.75	Transitions:
54.61/54.75	<l2, l2, 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Variables:
54.61/54.75	arg1, arg2
54.61/54.75	Checking conditional termination of SCC {l2}...
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.000801s
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.003341s
54.61/54.75	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007355s
54.61/54.75	Time used: 0.007194
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002873s
54.61/54.75	Time used: 4.00237
54.61/54.75	Solving with 2 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.068465s
54.61/54.75	Time used: 4.00099
54.61/54.75	Solving with 3 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006292s
54.61/54.75	Time used: 1.0004
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014104s
54.61/54.75	Time used: 0.010638
54.61/54.75	Improving Solution with cost 1 ...
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetNextSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035282s
54.61/54.75	Time used: 0.035275
54.61/54.75	
54.61/54.75	LOG: SAT solveNonLinear - Elapsed time: 0.049386s
54.61/54.75	Cost: 1; Total time: 0.045913
54.61/54.75	Termination implied by a set of invariant(s):
54.61/54.75	Invariant at l2: arg2 <= 0
54.61/54.75	[ Invariant Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg1 + arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	[ Termination Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Quasi-ranking function: 50000 + 2*arg1 - arg2
54.61/54.75	New Graphs: 
54.61/54.75	Transitions:
54.61/54.75	<l2, l2, 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0 /\ 50001 + 2*arg1 <= arg2, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Variables:
54.61/54.75	arg1, arg2
54.61/54.75	Checking conditional termination of SCC {l2}...
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.000926s
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.004221s
54.61/54.75	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1 /\ 1 + arg2 <= 0 /\ 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0 /\ 50001 + 2*arg1 <= arg2, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008204s
54.61/54.75	Time used: 0.008035
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001189s
54.61/54.75	Time used: 4.00069
54.61/54.75	Solving with 2 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005572s
54.61/54.75	Time used: 4.00055
54.61/54.75	Solving with 3 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005451s
54.61/54.75	Time used: 1.00075
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015171s
54.61/54.75	Time used: 0.011745
54.61/54.75	Improving Solution with cost 1 ...
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetNextSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026762s
54.61/54.75	Time used: 0.026756
54.61/54.75	
54.61/54.75	LOG: SAT solveNonLinear - Elapsed time: 0.041933s
54.61/54.75	Cost: 1; Total time: 0.038501
54.61/54.75	Quasi-ranking function: 50000 + arg2
54.61/54.75	New Graphs: 
54.61/54.75	Transitions:
54.61/54.75	<l2, l2, 1 + arg2 <= arg1 /\ 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0 /\ 50001 + 2*arg1 <= arg2 /\ 50001 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Variables:
54.61/54.75	arg1, arg2
54.61/54.75	Checking conditional termination of SCC {l2}...
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.000869s
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.003724s
54.61/54.75	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1 /\ 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0 /\ 50001 + 2*arg1 <= arg2 /\ 50001 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008685s
54.61/54.75	Time used: 0.008517
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.050234s
54.61/54.75	Time used: 4.04946
54.61/54.75	Solving with 2 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006569s
54.61/54.75	Time used: 4.00063
54.61/54.75	Solving with 3 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.015835s
54.61/54.75	Time used: 1.01031
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015462s
54.61/54.75	Time used: 0.012167
54.61/54.75	Improving Solution with cost 1 ...
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetNextSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022585s
54.61/54.75	Time used: 0.022579
54.61/54.75	
54.61/54.75	LOG: SAT solveNonLinear - Elapsed time: 0.038047s
54.61/54.75	Cost: 1; Total time: 0.034746
54.61/54.75	Termination implied by a set of invariant(s):
54.61/54.75	Invariant at l2: arg1 <= 1 + arg2
54.61/54.75	[ Invariant Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg1 + arg2 <= 0 /\ 1 + arg2 <= 0 /\ arg1 = 1 + arg2, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	[ Termination Graph ]
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0 /\ 50001 + 2*arg1 <= arg2 /\ 50001 + arg2 <= 0 /\ arg1 = 1 + arg2, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Quasi-ranking function: 50000 - arg1 + 2*arg2
54.61/54.75	New Graphs: 
54.61/54.75	Transitions:
54.61/54.75	<l2, l2, 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0 /\ 50001 + 2*arg2 <= arg1 /\ 50001 + 2*arg1 <= arg2 /\ 50001 + arg2 <= 0 /\ arg1 = 1 + arg2, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Variables:
54.61/54.75	arg1, arg2
54.61/54.75	Checking conditional termination of SCC {l2}...
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.000888s
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.003393s
54.61/54.75	Trying to remove transition: <l2, l2, 50001 + arg1 <= 0 /\ 50001 + arg1 + arg2 <= 0 /\ 50001 + 2*arg2 <= arg1 /\ 50001 + 2*arg1 <= arg2 /\ 50001 + arg2 <= 0 /\ arg1 = 1 + arg2, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008739s
54.61/54.75	Time used: 0.008566
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002005s
54.61/54.75	Time used: 4.00126
54.61/54.75	Solving with 2 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.035904s
54.61/54.75	Time used: 4.00122
54.61/54.75	Solving with 3 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003535s
54.61/54.75	Time used: 1.00052
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014571s
54.61/54.75	Time used: 0.011266
54.61/54.75	Termination failed. Trying to show unreachability...
54.61/54.75	Proving unreachability of entry: <l0, l2, 0 <= undef6 /\ 1 <= undef5 /\ 1 + arg1 + undef6 = 0 /\ 2 + arg2 + undef6 = 0, {all remain the same}>
54.61/54.75	
54.61/54.75	LOG: CALL check - Post:1 <= 0 - Process 1
54.61/54.75	* Exit transition: <l0, l2, 0 <= undef6 /\ 1 <= undef5 /\ 1 + arg1 + undef6 = 0 /\ 2 + arg2 + undef6 = 0, {all remain the same}>
54.61/54.75	* Postcondition  : 1 <= 0
54.61/54.75	
54.61/54.75	LOG: CALL solveLinear
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear - Elapsed time: 0.001476s
54.61/54.75	> Postcondition is not implied!
54.61/54.75	
54.61/54.75	LOG: RETURN check - Elapsed time: 0.001574s
54.61/54.75	Cannot prove unreachability
54.61/54.75	
54.61/54.75	Proving non-termination of subgraph 1
54.61/54.75	Transitions:
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	Variables:
54.61/54.75	arg1, arg2
54.61/54.75	
54.61/54.75	Checking conditional non-termination of SCC {l2}...
54.61/54.75	EXIT TRANSITIONS:
54.61/54.75	<l2, end, 1 <= arg1 /\ 1 + arg2 <= arg1, {all remain the same}>
54.61/54.75	<l2, end, arg1 <= arg2 /\ 0 <= arg2 /\ 1 <= arg1, {all remain the same}>
54.61/54.75	<l2, end, arg1 <= 0 /\ arg1 <= arg2, {all remain the same}>
54.61/54.75	
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009636s
54.61/54.75	Time used: 0.009427
54.61/54.75	Improving Solution with cost 2 ...
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetNextSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010306s
54.61/54.75	Time used: 0.010301
54.61/54.75	
54.61/54.75	LOG: SAT solveNonLinear - Elapsed time: 0.019942s
54.61/54.75	Cost: 2; Total time: 0.019728
54.61/54.75	Non-termination implied by a set of quasi-invariant(s):
54.61/54.75	Quasi-invariant at l2: 1 + arg2 <= arg1
54.61/54.75	
54.61/54.75	Strengthening and disabling EXIT transitions...
54.61/54.75	Closed exits from l2: 2
54.61/54.75	Strengthening exit transition (result): 
54.61/54.75	<l2, end, 1 <= arg1 /\ 1 + arg2 <= arg1, {all remain the same}>
54.61/54.75	
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	
54.61/54.75	Checking conditional non-termination of SCC {l2}...
54.61/54.75	EXIT TRANSITIONS:
54.61/54.75	<l2, end, 1 <= arg1 /\ 1 + arg2 <= arg1, {all remain the same}>
54.61/54.75	
54.61/54.75	Solving with 1 template(s).
54.61/54.75	
54.61/54.75	LOG: CALL solveNonLinearGetFirstSolution
54.61/54.75	
54.61/54.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005406s
54.61/54.75	Time used: 0.005303
54.61/54.75	
54.61/54.75	LOG: SAT solveNonLinear - Elapsed time: 0.005406s
54.61/54.75	Cost: 0; Total time: 0.005303
54.61/54.75	Non-termination implied by a set of quasi-invariant(s):
54.61/54.75	Quasi-invariant at l2: arg1 <= 0
54.61/54.75	
54.61/54.75	Strengthening and disabling EXIT transitions...
54.61/54.75	Closed exits from l2: 1
54.61/54.75	
54.61/54.75	Strengthening and disabling transitions...
54.61/54.75	
54.61/54.75	LOG: CALL solverLinear in Graph for feasibility
54.61/54.75	
54.61/54.75	LOG: RETURN solveLinear in Graph for feasibility
54.61/54.75	Strengthening transition (result): 
54.61/54.75	<l2, l2, arg1 <= 0 /\ 1 + arg2 <= arg1 /\ 1 + arg2 <= 0, {arg1 -> arg2, arg2 -> -1 + arg2, rest remain the same}>
54.61/54.75	
54.61/54.75	Calling reachability with...
54.61/54.75	Transition: <l2, end, true, {all remain the same}>
54.61/54.75	Conditions: 1 + arg2 <= arg1, arg1 <= 0, 
54.61/54.75	OPEN EXITS: 
54.61/54.75	<l2, end, arg1 <= 0 /\ 1 + arg2 <= arg1, {all remain the same}>
54.61/54.75	
54.61/54.75	--- Reachability graph ---
54.61/54.75	> Graph without transitions.
54.61/54.75	
54.61/54.75	Calling reachability with...
54.61/54.75	Transition: <l0, l2, 0 <= undef6 /\ 1 <= undef5 /\ 1 + arg1 + undef6 = 0 /\ 2 + arg2 + undef6 = 0, {all remain the same}>
54.61/54.75	Conditions: arg1 <= 0, 1 + arg2 <= arg1, 
54.61/54.75	OPEN EXITS: 
54.61/54.75	<l0, l2, arg1 <= 0 /\ 0 <= undef6 /\ 1 + arg2 <= arg1 /\ 1 <= undef5 /\ 1 + arg1 + undef6 = 0 /\ 2 + arg2 + undef6 = 0, {all remain the same}>
54.61/54.75	
54.61/54.75	> Conditions are reachable!
54.61/54.75	
54.61/54.75	Program does NOT terminate
54.61/54.75	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
54.61/54.75	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
54.61/54.75	EOF