71.15/71.25	NO
71.15/71.25	
71.15/71.25	Solver Timeout: 4
71.15/71.25	Global Timeout: 300
71.15/71.25	No parsing errors!
71.15/71.25	Init Location: 0
71.15/71.25	Transitions:
71.15/71.25	<l0, l4, true>
71.15/71.25	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 20, arg2 -> ~(20), arg3 -> arg2}>
71.15/71.25	<l2, l3, ((arg1 - arg3) < 5) /\ (arg3 <= arg1) /\ (arg3 >= arg2), par{arg1 -> arg3, arg2 -> (~(1) * arg3), arg3 -> arg1}>
71.15/71.25	<l2, l3, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) < 5), par{arg1 -> arg3, arg2 -> (~(1) * arg3), arg3 -> arg1}>
71.15/71.25	<l3, l2, (arg1 <= arg3), par{arg1 -> arg3, arg2 -> (0 - arg3), arg3 -> arg2}>
71.15/71.25	<l2, l2, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 < 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}>
71.15/71.25	<l2, l2, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 > 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}>
71.15/71.25	<l2, l2, (arg1 > 5) /\ (arg2 < 2) /\ (1 = arg3), par{arg1 -> ~(1), arg2 -> 1, arg3 -> 0}>
71.15/71.25	<l4, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}>
71.15/71.25	
71.15/71.25	Fresh variables:
71.15/71.25	undef22, undef23, undef24, 
71.15/71.25	
71.15/71.25	Undef variables:
71.15/71.25	undef22, undef23, undef24, 
71.15/71.25	
71.15/71.25	Abstraction variables:
71.15/71.25	
71.15/71.25	Exit nodes:
71.15/71.25	
71.15/71.25	Accepting locations:
71.15/71.25	
71.15/71.25	Asserts:
71.15/71.25	
71.15/71.25	Preprocessed LLVMGraph
71.15/71.25	Init Location: 0
71.15/71.25	Transitions:
71.15/71.25	<l0, l2, (arg1 = 20) /\ (arg2 = ~(20)) /\ (arg3 = undef23) /\ (undef22 > 0) /\ (undef23 > ~(1))>
71.15/71.25	<l2, l2, ((arg1 - arg3) < 5) /\ (arg3 <= arg1) /\ (arg3 >= arg2) /\ (arg3 <= arg1), par{arg1 -> arg1, arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}>
71.15/71.25	<l2, l2, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) < 5) /\ (arg3 <= arg1), par{arg1 -> arg1, arg2 -> (0 - arg1), arg3 -> (~(1) * arg3)}>
71.15/71.25	<l2, l2, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 < 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}>
71.15/71.25	<l2, l2, (arg3 <= arg1) /\ (arg3 >= arg2) /\ ((arg1 - arg3) >= 5) /\ ((arg1 + arg3) >= 5) /\ (arg3 > 1) /\ (arg3 < (arg1 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (0 - (arg1 + 1)), arg3 -> (arg3 - 1)}>
71.15/71.25	<l2, l2, (arg1 > 5) /\ (arg2 < 2) /\ (1 = arg3), par{arg1 -> ~(1), arg2 -> 1, arg3 -> 0}>
71.15/71.25	
71.15/71.25	Fresh variables:
71.15/71.25	undef22, undef23, undef24, 
71.15/71.25	
71.15/71.25	Undef variables:
71.15/71.25	undef22, undef23, undef24, 
71.15/71.25	
71.15/71.25	Abstraction variables:
71.15/71.25	
71.15/71.25	Exit nodes:
71.15/71.25	
71.15/71.25	Accepting locations:
71.15/71.25	
71.15/71.25	Asserts:
71.15/71.25	
71.15/71.25	*************************************************************
71.15/71.25	*******************************************************************************************
71.15/71.25	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
71.15/71.25	*******************************************************************************************
71.15/71.25	
71.15/71.25	Init Location: 0
71.15/71.25	Graph 0:
71.15/71.25	Transitions:
71.15/71.25	Variables:
71.15/71.25	
71.15/71.25	Graph 1:
71.15/71.25	Transitions:
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= 1 /\ 6 <= arg1 /\ arg3 = 1, {arg1 -> -1, arg2 -> 1, arg3 -> 0, rest remain the same}>
71.15/71.25	Variables:
71.15/71.25	arg1, arg2, arg3
71.15/71.25	
71.15/71.25	Precedence: 
71.15/71.25	Graph 0
71.15/71.25	
71.15/71.25	Graph 1
71.15/71.25	<l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg3 = undef23 /\ 20 + arg2 = 0 /\ arg1 = 20, {all remain the same}>
71.15/71.25	
71.15/71.25	Map Locations to Subgraph:
71.15/71.25	( 0 , 0 )
71.15/71.25	( 2 , 1 )
71.15/71.25	
71.15/71.25	*******************************************************************************************
71.15/71.25	********************************    CHECKING ASSERTIONS    ********************************
71.15/71.25	*******************************************************************************************
71.15/71.25	
71.15/71.25	Proving termination of subgraph 0
71.15/71.25	Proving termination of subgraph 1
71.15/71.25	Checking unfeasibility...
71.15/71.25	Time used: 0.087305
71.15/71.25	
71.15/71.25	Checking conditional termination of SCC {l2}...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.005208s
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.040956s
71.15/71.25	Piecewise ranking function: min(1 + 10*arg1 - 10*arg3,0)
71.15/71.25	New Graphs: 
71.15/71.25	Transitions:
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Variables:
71.15/71.25	arg1, arg2, arg3
71.15/71.25	Checking conditional termination of SCC {l2}...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.002341s
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.121794s
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027944s
71.15/71.25	Time used: 0.02708
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023007s
71.15/71.25	Time used: 0.021508
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027488s
71.15/71.25	Time used: 0.026043
71.15/71.25	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014154s
71.15/71.25	Time used: 0.012699
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.113349s
71.15/71.25	Time used: 0.111193
71.15/71.25	Improving Solution with cost 1 ...
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetNextSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000942s
71.15/71.25	Time used: 1.00091
71.15/71.25	
71.15/71.25	LOG: SAT solveNonLinear - Elapsed time: 1.114291s
71.15/71.25	Cost: 1; Total time: 1.11211
71.15/71.25	Failed at location 2: 1 + arg1 <= arg3
71.15/71.25	Before Improving: 
71.15/71.25	Quasi-invariant at l2: 1 + arg1 <= arg3
71.15/71.25	Optimizing invariants...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.025757s
71.15/71.25	Remaining time after improvement: 0.994531
71.15/71.25	Termination implied by a set of quasi-invariant(s):
71.15/71.25	Quasi-invariant at l2: 1 + arg1 <= arg3
71.15/71.25	[ Invariant Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= 1 /\ 6 <= arg1 /\ arg3 = 1, {arg1 -> -1, arg2 -> 1, arg3 -> 0, rest remain the same}>
71.15/71.25	[ Termination Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	New Graphs: 
71.15/71.25	Calling Safety with literal 1 + arg1 <= arg3 and entry <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg3 = undef23 /\ 20 + arg2 = 0 /\ arg1 = 20, {all remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL check - Post:1 + arg1 <= arg3 - Process 1
71.15/71.25	* Exit transition: <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg3 = undef23 /\ 20 + arg2 = 0 /\ arg1 = 20, {all remain the same}>
71.15/71.25	* Postcondition  : 1 + arg1 <= arg3
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.001087s
71.15/71.25	> Postcondition is not implied!
71.15/71.25	
71.15/71.25	LOG: RETURN check - Elapsed time: 0.001205s
71.15/71.25	INVARIANTS: 
71.15/71.25	2: 
71.15/71.25	Quasi-INVARIANTS to narrow Graph: 
71.15/71.25	2: 1 + arg1 <= arg3 , 
71.15/71.25	Narrowing transition: 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: Narrow transition size 1
71.15/71.25	Narrowing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: Narrow transition size 1
71.15/71.25	Narrowing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: Narrow transition size 1
71.15/71.25	Narrowing transition: 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: Narrow transition size 1
71.15/71.25	It's unfeasible. Removing transition: 
71.15/71.25	<l2, l2, arg2 <= 1 /\ 6 <= arg1 /\ arg3 = 1, {arg1 -> -1, arg2 -> 1, arg3 -> 0, rest remain the same}>
71.15/71.25	invGraph after Narrowing: 
71.15/71.25	Transitions:
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Variables:
71.15/71.25	arg1, arg2, arg3
71.15/71.25	Checking conditional termination of SCC {l2}...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.002366s
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.122776s
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028967s
71.15/71.25	Time used: 0.027705
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023849s
71.15/71.25	Time used: 0.021999
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029009s
71.15/71.25	Time used: 0.026867
71.15/71.25	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015127s
71.15/71.25	Time used: 0.013262
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003891s
71.15/71.25	Time used: 4.00133
71.15/71.25	Solving with 2 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.021597s
71.15/71.25	Time used: 4.0014
71.15/71.25	Solving with 3 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.060922s
71.15/71.25	Time used: 1.00218
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085878s
71.15/71.25	Time used: 0.081333
71.15/71.25	Improving Solution with cost 1 ...
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetNextSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001323s
71.15/71.25	Time used: 1.00131
71.15/71.25	
71.15/71.25	LOG: SAT solveNonLinear - Elapsed time: 1.087201s
71.15/71.25	Cost: 1; Total time: 1.08264
71.15/71.25	Termination implied by a set of invariant(s):
71.15/71.25	Invariant at l2: arg2 <= 1 + arg3
71.15/71.25	[ Invariant Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	[ Termination Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Quasi-ranking function: 50000 - arg1
71.15/71.25	New Graphs: 
71.15/71.25	Transitions:
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Variables:
71.15/71.25	arg1, arg2, arg3
71.15/71.25	Checking conditional termination of SCC {l2}...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.002838s
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.212129s
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043917s
71.15/71.25	Time used: 0.042404
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026710s
71.15/71.25	Time used: 0.024719
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037934s
71.15/71.25	Time used: 0.035905
71.15/71.25	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017697s
71.15/71.25	Time used: 0.015597
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003778s
71.15/71.25	Time used: 4.00105
71.15/71.25	Solving with 2 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.022214s
71.15/71.25	Time used: 4.00181
71.15/71.25	Solving with 3 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.025395s
71.15/71.25	Time used: 1.00011
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.090831s
71.15/71.25	Time used: 0.08752
71.15/71.25	Improving Solution with cost 1 ...
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetNextSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000958s
71.15/71.25	Time used: 1.00094
71.15/71.25	
71.15/71.25	LOG: SAT solveNonLinear - Elapsed time: 1.091789s
71.15/71.25	Cost: 1; Total time: 1.08846
71.15/71.25	Termination implied by a set of invariant(s):
71.15/71.25	Invariant at l2: arg1 + arg2 <= 0
71.15/71.25	[ Invariant Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	[ Termination Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Quasi-ranking function: 50000 - 99998*arg1 - arg2
71.15/71.25	New Graphs: 
71.15/71.25	Transitions:
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Variables:
71.15/71.25	arg1, arg2, arg3
71.15/71.25	Checking conditional termination of SCC {l2}...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.003350s
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.876777s
71.15/71.25	Trying to remove transition: <l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045772s
71.15/71.25	Time used: 0.044055
71.15/71.25	Trying to remove transition: <l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034367s
71.15/71.25	Time used: 0.032329
71.15/71.25	Trying to remove transition: <l2, l2, arg1 + arg2 <= 0 /\ arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035957s
71.15/71.25	Time used: 0.033785
71.15/71.25	Trying to remove transition: <l2, l2, arg1 + arg2 <= 0 /\ arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018812s
71.15/71.25	Time used: 0.017063
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003272s
71.15/71.25	Time used: 4.00122
71.15/71.25	Solving with 2 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015143s
71.15/71.25	Time used: 4.00173
71.15/71.25	Solving with 3 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003977s
71.15/71.25	Time used: 1.00001
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.103353s
71.15/71.25	Time used: 0.098734
71.15/71.25	Improving Solution with cost 1 ...
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetNextSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001159s
71.15/71.25	Time used: 1.00114
71.15/71.25	
71.15/71.25	LOG: SAT solveNonLinear - Elapsed time: 1.104512s
71.15/71.25	Cost: 1; Total time: 1.09987
71.15/71.25	Termination implied by a set of invariant(s):
71.15/71.25	Invariant at l2: 0 <= arg1 + arg2
71.15/71.25	[ Invariant Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	[ Termination Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Quasi-ranking function: 50000 + arg2
71.15/71.25	New Graphs: 
71.15/71.25	Transitions:
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Variables:
71.15/71.25	arg1, arg2, arg3
71.15/71.25	Checking conditional termination of SCC {l2}...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.003514s
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.200227s
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047017s
71.15/71.25	Time used: 0.045706
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035829s
71.15/71.25	Time used: 0.033769
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043028s
71.15/71.25	Time used: 0.04112
71.15/71.25	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020292s
71.15/71.25	Time used: 0.01812
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004484s
71.15/71.25	Time used: 4.00204
71.15/71.25	Solving with 2 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.042718s
71.15/71.25	Time used: 4.00141
71.15/71.25	Solving with 3 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.025737s
71.15/71.25	Time used: 1.00007
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096808s
71.15/71.25	Time used: 0.09226
71.15/71.25	Improving Solution with cost 1 ...
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetNextSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001773s
71.15/71.25	Time used: 1.00176
71.15/71.25	
71.15/71.25	LOG: SAT solveNonLinear - Elapsed time: 1.098582s
71.15/71.25	Cost: 1; Total time: 1.09402
71.15/71.25	Termination implied by a set of invariant(s):
71.15/71.25	Invariant at l2: 0 <= 1 + arg1 + arg2
71.15/71.25	[ Invariant Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	[ Termination Graph ]
71.15/71.25	Strengthening and disabling transitions...
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	
71.15/71.25	LOG: CALL solverLinear in Graph for feasibility
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.25	Strengthening transition (result): 
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Quasi-ranking function: 50000 + 2*arg1 + 3*arg2
71.15/71.25	New Graphs: 
71.15/71.25	Transitions:
71.15/71.25	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Variables:
71.15/71.25	arg1, arg2, arg3
71.15/71.25	Checking conditional termination of SCC {l2}...
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.003565s
71.15/71.25	
71.15/71.25	LOG: CALL solveLinear
71.15/71.25	
71.15/71.25	LOG: RETURN solveLinear - Elapsed time: 0.312120s
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046481s
71.15/71.25	Time used: 0.044812
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033637s
71.15/71.25	Time used: 0.031481
71.15/71.25	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047368s
71.15/71.25	Time used: 0.045053
71.15/71.25	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021695s
71.15/71.25	Time used: 0.019863
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002833s
71.15/71.25	Time used: 4.00072
71.15/71.25	Solving with 2 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010154s
71.15/71.25	Time used: 4.00179
71.15/71.25	Solving with 3 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003633s
71.15/71.25	Time used: 1.00015
71.15/71.25	Solving with 1 template(s).
71.15/71.25	
71.15/71.25	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.25	
71.15/71.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104259s
71.15/71.25	Time used: 0.098998
71.15/71.25	Improving Solution with cost 1 ...
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetNextSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001723s
71.15/71.26	Time used: 1.00155
71.15/71.26	
71.15/71.26	LOG: SAT solveNonLinear - Elapsed time: 1.105982s
71.15/71.26	Cost: 1; Total time: 1.10055
71.15/71.26	Termination implied by a set of invariant(s):
71.15/71.26	Invariant at l2: 1 + arg2 <= 0
71.15/71.26	[ Invariant Graph ]
71.15/71.26	Strengthening and disabling transitions...
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ 1 + arg2 <= 0 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 1 + arg2 <= 0 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 1 + arg2 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 1 + arg2 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	[ Termination Graph ]
71.15/71.26	Strengthening and disabling transitions...
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ 1 + arg2 <= 0 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 1 + arg2 <= 0 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	Quasi-ranking function: 50000 - arg1 + arg2
71.15/71.26	New Graphs: 
71.15/71.26	Transitions:
71.15/71.26	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ 1 + arg2 <= 0 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 1 + arg2 <= 0 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	Variables:
71.15/71.26	arg1, arg2, arg3
71.15/71.26	Checking conditional termination of SCC {l2}...
71.15/71.26	
71.15/71.26	LOG: CALL solveLinear
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear - Elapsed time: 0.004002s
71.15/71.26	
71.15/71.26	LOG: CALL solveLinear
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear - Elapsed time: 0.451984s
71.15/71.26	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053792s
71.15/71.26	Time used: 0.051875
71.15/71.26	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 50001 <= arg1 /\ 50001 + arg2 <= arg1 /\ 50001 + 2*arg1 + 3*arg2 <= 0 /\ 50001 <= 99998*arg1 + arg2 /\ 50001 + arg2 <= 0 /\ arg1 + arg2 = 0, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038920s
71.15/71.26	Time used: 0.036642
71.15/71.26	Trying to remove transition: <l2, l2, arg2 <= arg3 /\ 1 + arg2 <= 0 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048664s
71.15/71.26	Time used: 0.046265
71.15/71.26	Trying to remove transition: <l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ 1 + arg2 <= 0 /\ arg1 <= 4 + arg3 /\ arg1 + arg2 = 0, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032168s
71.15/71.26	Time used: 0.030294
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007165s
71.15/71.26	Time used: 4.0045
71.15/71.26	Solving with 2 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.044575s
71.15/71.26	Time used: 4.0015
71.15/71.26	Solving with 3 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.025994s
71.15/71.26	Time used: 1.00012
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005717s
71.15/71.26	Time used: 4.00036
71.15/71.26	
71.15/71.26	Proving non-termination of subgraph 1
71.15/71.26	Transitions:
71.15/71.26	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	Variables:
71.15/71.26	arg1, arg2, arg3
71.15/71.26	
71.15/71.26	Checking conditional non-termination of SCC {l2}...
71.15/71.26	EXIT TRANSITIONS:
71.15/71.26	<l2, end, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ arg3 = 1, {all remain the same}>
71.15/71.26	<l2, end, 1 + arg3 <= arg2 /\ 1 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {all remain the same}>
71.15/71.26	<l2, end, arg3 <= 0 /\ 1 + arg3 <= arg2 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {all remain the same}>
71.15/71.26	<l2, end, arg3 <= 0 /\ 1 + arg3 <= arg2 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {all remain the same}>
71.15/71.26	<l2, end, arg3 <= arg1 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ 5 <= arg1 + arg3 /\ arg1 <= 4 + arg3, {all remain the same}>
71.15/71.26	<l2, end, arg3 <= arg1 /\ 1 + arg3 <= arg2 /\ 1 <= arg3 /\ arg1 + arg3 <= 4 /\ arg1 <= 4 + arg3, {all remain the same}>
71.15/71.26	<l2, end, arg3 <= arg1 /\ arg3 <= 0 /\ 1 + arg3 <= arg2 /\ arg1 + arg3 <= 4 /\ arg1 <= 4 + arg3, {all remain the same}>
71.15/71.26	<l2, end, 1 + arg1 <= arg3 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {all remain the same}>
71.15/71.26	<l2, end, 1 + arg1 <= arg3 /\ 1 <= arg3 /\ arg1 + arg3 <= 4, {all remain the same}>
71.15/71.26	<l2, end, arg3 <= 0 /\ 1 + arg1 <= arg3 /\ arg1 + arg3 <= 4, {all remain the same}>
71.15/71.26	
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101523s
71.15/71.26	Time used: 0.101033
71.15/71.26	Improving Solution with cost 11 ...
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetNextSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.194399s
71.15/71.26	Time used: 0.194381
71.15/71.26	
71.15/71.26	LOG: SAT solveNonLinear - Elapsed time: 0.295922s
71.15/71.26	Cost: 11; Total time: 0.295414
71.15/71.26	Non-termination implied by a set of quasi-invariant(s):
71.15/71.26	Quasi-invariant at l2: arg2 <= arg3
71.15/71.26	
71.15/71.26	Strengthening and disabling EXIT transitions...
71.15/71.26	Closed exits from l2: 6
71.15/71.26	Strengthening exit transition (result): 
71.15/71.26	<l2, end, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ arg3 = 1, {all remain the same}>
71.15/71.26	Strengthening exit transition (result): 
71.15/71.26	<l2, end, arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {all remain the same}>
71.15/71.26	Strengthening exit transition (result): 
71.15/71.26	<l2, end, arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ arg1 + arg3 <= 4, {all remain the same}>
71.15/71.26	Strengthening exit transition (result): 
71.15/71.26	<l2, end, arg2 <= arg3 /\ arg3 <= 0 /\ 1 + arg1 <= arg3 /\ arg1 + arg3 <= 4, {all remain the same}>
71.15/71.26	
71.15/71.26	Strengthening and disabling transitions...
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	Checking conditional non-termination of SCC {l2}...
71.15/71.26	EXIT TRANSITIONS:
71.15/71.26	<l2, end, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ arg3 = 1, {all remain the same}>
71.15/71.26	<l2, end, arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 5 <= arg1 + arg3 /\ 2 <= arg3, {all remain the same}>
71.15/71.26	<l2, end, arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 1 <= arg3 /\ arg1 + arg3 <= 4, {all remain the same}>
71.15/71.26	<l2, end, arg2 <= arg3 /\ arg3 <= 0 /\ 1 + arg1 <= arg3 /\ arg1 + arg3 <= 4, {all remain the same}>
71.15/71.26	
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035053s
71.15/71.26	Time used: 0.03471
71.15/71.26	Improving Solution with cost 5 ...
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetNextSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.092152s
71.15/71.26	Time used: 0.092145
71.15/71.26	Improving Solution with cost 3 ...
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetNextSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.097976s
71.15/71.26	Time used: 0.09797
71.15/71.26	
71.15/71.26	LOG: SAT solveNonLinear - Elapsed time: 0.225182s
71.15/71.26	Cost: 3; Total time: 0.224825
71.15/71.26	Non-termination implied by a set of quasi-invariant(s):
71.15/71.26	Quasi-invariant at l2: 7 <= arg1
71.15/71.26	
71.15/71.26	Strengthening and disabling EXIT transitions...
71.15/71.26	Closed exits from l2: 2
71.15/71.26	Strengthening exit transition (result): 
71.15/71.26	<l2, end, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 7 <= arg1 /\ arg3 = 1, {all remain the same}>
71.15/71.26	Strengthening exit transition (result): 
71.15/71.26	<l2, end, arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 7 <= arg1, {all remain the same}>
71.15/71.26	
71.15/71.26	Strengthening and disabling transitions...
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ 7 <= arg1, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ 7 <= arg1, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 7 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 7 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	Checking conditional non-termination of SCC {l2}...
71.15/71.26	EXIT TRANSITIONS:
71.15/71.26	<l2, end, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 7 <= arg1 /\ arg3 = 1, {all remain the same}>
71.15/71.26	<l2, end, arg2 <= arg3 /\ 1 + arg1 <= arg3 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 7 <= arg1, {all remain the same}>
71.15/71.26	
71.15/71.26	Solving with 1 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117451s
71.15/71.26	Time used: 0.117342
71.15/71.26	Solving with 2 template(s).
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetFirstSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.153757s
71.15/71.26	Time used: 0.149563
71.15/71.26	Improving Solution with cost 2 ...
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetNextSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.312076s
71.15/71.26	Time used: 0.312068
71.15/71.26	Improving Solution with cost 1 ...
71.15/71.26	
71.15/71.26	LOG: CALL solveNonLinearGetNextSolution
71.15/71.26	
71.15/71.26	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001509s
71.15/71.26	Time used: 1.00134
71.15/71.26	
71.15/71.26	LOG: SAT solveNonLinear - Elapsed time: 1.467342s
71.15/71.26	Cost: 1; Total time: 1.46297
71.15/71.26	Failed at location 2: arg3 <= 0
71.15/71.26	Before Improving: 
71.15/71.26	Quasi-invariant at l2: arg3 <= 0
71.15/71.26	Quasi-invariant at l2: 5 <= arg1 + arg3
71.15/71.26	Optimizing invariants...
71.15/71.26	
71.15/71.26	LOG: CALL solveLinear
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear - Elapsed time: 0.048325s
71.15/71.26	Remaining time after improvement: 0.99573
71.15/71.26	Non-termination implied by a set of quasi-invariant(s):
71.15/71.26	Quasi-invariant at l2: arg3 <= 0
71.15/71.26	Quasi-invariant at l2: 5 <= arg1 + arg3
71.15/71.26	
71.15/71.26	Strengthening and disabling EXIT transitions...
71.15/71.26	Closed exits from l2: 2
71.15/71.26	
71.15/71.26	Strengthening and disabling transitions...
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	It's unfeasible. Removing transition: 
71.15/71.26	<l2, l2, arg3 <= arg1 /\ arg2 <= arg3 /\ arg1 <= 4 + arg3 /\ 7 <= arg1, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	It's unfeasible. Removing transition: 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ arg1 + arg3 <= 4 /\ 7 <= arg1, {arg2 -> -arg1, arg3 -> -arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	Strengthening transition (result): 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 7 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	LOG: CALL solverLinear in Graph for feasibility
71.15/71.26	
71.15/71.26	LOG: RETURN solveLinear in Graph for feasibility
71.15/71.26	It's unfeasible. Removing transition: 
71.15/71.26	<l2, l2, arg2 <= arg3 /\ 5 + arg3 <= arg1 /\ 5 <= arg1 + arg3 /\ 2 <= arg3 /\ 7 <= arg1, {arg1 -> 1 + arg1, arg2 -> -1 - arg1, arg3 -> -1 + arg3, rest remain the same}>
71.15/71.26	
71.15/71.26	Calling reachability with...
71.15/71.26	Transition: <l2, end, true, {all remain the same}>
71.15/71.26	Conditions: arg2 <= arg3, 7 <= arg1, arg3 <= 0, 5 <= arg1 + arg3, 
71.15/71.26	OPEN EXITS: 
71.15/71.26	<l2, end, arg2 <= arg3 /\ arg3 <= 0 /\ 5 <= arg1 + arg3 /\ 7 <= arg1, {all remain the same}>
71.15/71.26	
71.15/71.26	--- Reachability graph ---
71.15/71.26	> Graph without transitions.
71.15/71.26	
71.15/71.26	Calling reachability with...
71.15/71.26	Transition: <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg3 = undef23 /\ 20 + arg2 = 0 /\ arg1 = 20, {all remain the same}>
71.15/71.26	Conditions: arg2 <= arg3, arg3 <= 0, 5 <= arg1 + arg3, 7 <= arg1, 
71.15/71.26	OPEN EXITS: 
71.15/71.26	<l0, l2, arg2 <= arg3 /\ arg3 <= 0 /\ 0 <= undef23 /\ 1 <= undef22 /\ 5 <= arg1 + arg3 /\ arg3 = undef23 /\ 20 + arg2 = 0 /\ arg1 = 20, {all remain the same}>
71.15/71.26	
71.15/71.26	> Conditions are reachable!
71.15/71.26	
71.15/71.26	Program does NOT terminate
71.15/71.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
71.15/71.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
71.15/71.26	EOF