90.50/90.71	NO
90.50/90.71	
90.50/90.71	Solver Timeout: 4
90.50/90.71	Global Timeout: 300
90.50/90.71	No parsing errors!
90.50/90.71	Init Location: 0
90.50/90.71	Transitions:
90.50/90.71	<l0, l3, true>
90.50/90.71	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 1, arg2 -> 1, arg3 -> arg2}>
90.50/90.71	<l2, l2, (arg3 < 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}>
90.50/90.71	<l2, l2, (arg3 > 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}>
90.50/90.71	<l2, l2, (arg3 < 0) /\ (arg3 < (0 - arg2)) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) + 1)}>
90.50/90.71	<l2, l2, (arg3 > 0) /\ (arg3 < (0 - arg2)) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) + 1)}>
90.50/90.71	<l2, l2, (arg3 >= (0 - arg2)) /\ (arg3 > 1) /\ (arg2 < arg3) /\ (arg1 > 0) /\ (2 > (~(1) * arg3)) /\ ((arg2 + 1) <= arg3) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) - 1)}>
90.50/90.71	<l3, l1, true, par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}>
90.50/90.71	
90.50/90.71	Fresh variables:
90.50/90.71	undef19, undef20, undef21, 
90.50/90.71	
90.50/90.71	Undef variables:
90.50/90.71	undef19, undef20, undef21, 
90.50/90.71	
90.50/90.71	Abstraction variables:
90.50/90.71	
90.50/90.71	Exit nodes:
90.50/90.71	
90.50/90.71	Accepting locations:
90.50/90.71	
90.50/90.71	Asserts:
90.50/90.71	
90.50/90.71	Preprocessed LLVMGraph
90.50/90.71	Init Location: 0
90.50/90.71	Transitions:
90.50/90.71	<l0, l2, (arg1 = 1) /\ (arg2 = 1) /\ (arg3 = undef20) /\ (undef19 > 0) /\ (undef20 > ~(1))>
90.50/90.71	<l2, l2, (arg3 < 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}>
90.50/90.71	<l2, l2, (arg3 > 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}>
90.50/90.71	<l2, l2, (arg3 < 0) /\ (arg3 < (0 - arg2)) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) + 1)}>
90.50/90.71	<l2, l2, (arg3 >= (0 - arg2)) /\ (arg3 > 1) /\ (arg2 < arg3) /\ (arg1 > 0) /\ (2 > (~(1) * arg3)) /\ ((arg2 + 1) <= arg3) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) - 1)}>
90.50/90.71	
90.50/90.71	Fresh variables:
90.50/90.71	undef19, undef20, undef21, 
90.50/90.71	
90.50/90.71	Undef variables:
90.50/90.71	undef19, undef20, undef21, 
90.50/90.71	
90.50/90.71	Abstraction variables:
90.50/90.71	
90.50/90.71	Exit nodes:
90.50/90.71	
90.50/90.71	Accepting locations:
90.50/90.71	
90.50/90.71	Asserts:
90.50/90.71	
90.50/90.71	*************************************************************
90.50/90.71	*******************************************************************************************
90.50/90.71	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
90.50/90.71	*******************************************************************************************
90.50/90.71	
90.50/90.71	Init Location: 0
90.50/90.71	Graph 0:
90.50/90.71	Transitions:
90.50/90.71	Variables:
90.50/90.71	
90.50/90.71	Graph 1:
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	
90.50/90.71	Precedence: 
90.50/90.71	Graph 0
90.50/90.71	
90.50/90.71	Graph 1
90.50/90.71	<l0, l2, 0 <= undef20 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.71	
90.50/90.71	Map Locations to Subgraph:
90.50/90.71	( 0 , 0 )
90.50/90.71	( 2 , 1 )
90.50/90.71	
90.50/90.71	*******************************************************************************************
90.50/90.71	********************************    CHECKING ASSERTIONS    ********************************
90.50/90.71	*******************************************************************************************
90.50/90.71	
90.50/90.71	Proving termination of subgraph 0
90.50/90.71	Proving termination of subgraph 1
90.50/90.71	Checking unfeasibility...
90.50/90.71	Time used: 0.019752
90.50/90.71	
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.003320s
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.376994s
90.50/90.71	Trying to remove transition: <l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033983s
90.50/90.71	Time used: 0.033188
90.50/90.71	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033933s
90.50/90.71	Time used: 0.032255
90.50/90.71	Trying to remove transition: <l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032155s
90.50/90.71	Time used: 0.030566
90.50/90.71	Trying to remove transition: <l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033333s
90.50/90.71	Time used: 0.031758
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003204s
90.50/90.71	Time used: 4.00086
90.50/90.71	Solving with 2 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.703665s
90.50/90.71	Time used: 0.67381
90.50/90.71	Improving Solution with cost 1 ...
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetNextSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003854s
90.50/90.71	Time used: 1.00365
90.50/90.71	
90.50/90.71	LOG: SAT solveNonLinear - Elapsed time: 1.707519s
90.50/90.71	Cost: 1; Total time: 1.67746
90.50/90.71	Failed at location 2: arg3 <= 0
90.50/90.71	Before Improving: 
90.50/90.71	Quasi-invariant at l2: arg3 <= 0
90.50/90.71	Quasi-invariant at l2: 1 <= arg2 + arg3
90.50/90.71	Optimizing invariants...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.011242s
90.50/90.71	Remaining time after improvement: 0.99357
90.50/90.71	Termination implied by a set of quasi-invariant(s):
90.50/90.71	Quasi-invariant at l2: arg3 <= 0
90.50/90.71	Quasi-invariant at l2: 1 <= arg2 + arg3
90.50/90.71	[ Invariant Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg2 + arg3 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	[ Termination Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg2 + arg3 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	New Graphs: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg2 + arg3 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.001326s
90.50/90.71	Ranking function: -1 - arg3
90.50/90.71	New Graphs: 
90.50/90.71	Calling Safety with literal arg3 <= 0 and entry <l0, l2, 0 <= undef20 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL check - Post:arg3 <= 0 - Process 1
90.50/90.71	* Exit transition: <l0, l2, 0 <= undef20 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.71	* Postcondition  : arg3 <= 0
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.000849s
90.50/90.71	> Postcondition is not implied!
90.50/90.71	
90.50/90.71	LOG: RETURN check - Elapsed time: 0.000960s
90.50/90.71	INVARIANTS: 
90.50/90.71	2: 
90.50/90.71	Quasi-INVARIANTS to narrow Graph: 
90.50/90.71	2: arg3 <= 0 , 1 <= arg2 + arg3 , 
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
90.50/90.71	Narrowing transition: 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: Narrow transition size 2
90.50/90.71	Narrowing transition: 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: Narrow transition size 2
90.50/90.71	invGraph after Narrowing: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.001637s
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.076937s
90.50/90.71	Trying to remove transition: <l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016605s
90.50/90.71	Time used: 0.016111
90.50/90.71	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028282s
90.50/90.71	Time used: 0.027549
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002767s
90.50/90.71	Time used: 4.00157
90.50/90.71	Solving with 2 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.247426s
90.50/90.71	Time used: 0.220997
90.50/90.71	Improving Solution with cost 1 ...
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetNextSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001074s
90.50/90.71	Time used: 1.001
90.50/90.71	
90.50/90.71	LOG: SAT solveNonLinear - Elapsed time: 1.248500s
90.50/90.71	Cost: 1; Total time: 1.22199
90.50/90.71	Failed at location 2: arg3 <= 1
90.50/90.71	Before Improving: 
90.50/90.71	Quasi-invariant at l2: arg3 <= 1
90.50/90.71	Quasi-invariant at l2: arg1 <= arg3
90.50/90.71	Optimizing invariants...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.034637s
90.50/90.71	Remaining time after improvement: 0.996154
90.50/90.71	Termination implied by a set of quasi-invariant(s):
90.50/90.71	Quasi-invariant at l2: arg3 <= 1
90.50/90.71	Quasi-invariant at l2: arg1 <= arg3
90.50/90.71	[ Invariant Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	[ Termination Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	> It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	New Graphs: 
90.50/90.71	Calling Safety with literal arg3 <= 1 and entry <l0, l2, 0 <= undef20 /\ 1 <= arg3 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL check - Post:arg3 <= 1 - Process 2
90.50/90.71	* Exit transition: <l0, l2, 0 <= undef20 /\ 1 <= arg3 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.71	* Postcondition  : arg3 <= 1
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.001435s
90.50/90.71	> Postcondition is not implied!
90.50/90.71	
90.50/90.71	LOG: RETURN check - Elapsed time: 0.001553s
90.50/90.71	INVARIANTS: 
90.50/90.71	2: 
90.50/90.71	Quasi-INVARIANTS to narrow Graph: 
90.50/90.71	2: arg1 <= arg3 , arg3 <= 1 , 
90.50/90.71	Narrowing transition: 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: Narrow transition size 2
90.50/90.71	Narrowing transition: 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: Narrow transition size 2
90.50/90.71	invGraph after Narrowing: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.002931s
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.494749s
90.50/90.71	Trying to remove transition: <l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020952s
90.50/90.71	Time used: 0.019867
90.50/90.71	
90.50/90.71	LOG: SAT solveNonLinear - Elapsed time: 0.020952s
90.50/90.71	Cost: 0; Total time: 0.019867
90.50/90.71	Termination implied by a set of quasi-invariant(s):
90.50/90.71	Quasi-invariant at l2: arg2 <= arg1
90.50/90.71	Ranking function: arg1 - arg2
90.50/90.71	Ranking function and negation of Quasi-Invariant applied
90.50/90.71	New Graphs: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.001953s
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.107847s
90.50/90.71	Trying to remove transition: <l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027350s
90.50/90.71	Time used: 0.026859
90.50/90.71	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026891s
90.50/90.71	Time used: 0.026034
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002340s
90.50/90.71	Time used: 4.001
90.50/90.71	Solving with 2 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.033447s
90.50/90.71	Time used: 4.00097
90.50/90.71	Solving with 3 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011207s
90.50/90.71	Time used: 1.00192
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067931s
90.50/90.71	Time used: 0.052664
90.50/90.71	Improving Solution with cost 1 ...
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetNextSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000841s
90.50/90.71	Time used: 1.00078
90.50/90.71	
90.50/90.71	LOG: SAT solveNonLinear - Elapsed time: 1.068772s
90.50/90.71	Cost: 1; Total time: 1.05345
90.50/90.71	Termination implied by a set of invariant(s):
90.50/90.71	Invariant at l2: 0 <= 1 + arg1
90.50/90.71	[ Invariant Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	[ Termination Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Quasi-ranking function: 50000 - arg2
90.50/90.71	New Graphs: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.003494s
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.500276s
90.50/90.71	Trying to remove transition: <l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034694s
90.50/90.71	Time used: 0.03408
90.50/90.71	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032409s
90.50/90.71	Time used: 0.031514
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002649s
90.50/90.71	Time used: 4.00149
90.50/90.71	Solving with 2 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.067230s
90.50/90.71	Time used: 4.01298
90.50/90.71	Solving with 3 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010156s
90.50/90.71	Time used: 1.00046
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077930s
90.50/90.71	Time used: 0.063187
90.50/90.71	Improving Solution with cost 1 ...
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetNextSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.006689s
90.50/90.71	Time used: 1.00663
90.50/90.71	
90.50/90.71	LOG: SAT solveNonLinear - Elapsed time: 1.084619s
90.50/90.71	Cost: 1; Total time: 1.06981
90.50/90.71	Termination implied by a set of invariant(s):
90.50/90.71	Invariant at l2: arg1 <= 1 + arg2
90.50/90.71	[ Invariant Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ arg1 <= 1 + arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	It's unfeasible. Removing transition: 
90.50/90.71	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	[ Termination Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg1 <= 1 + arg2 /\ 2 <= arg3 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Quasi-ranking function: 50000 - arg1 - arg2
90.50/90.71	New Graphs: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg1 <= 1 + arg2 /\ 2 <= arg3 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.002616s
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.490778s
90.50/90.71	Trying to remove transition: <l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg1 <= 1 + arg2 /\ 2 <= arg3 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036685s
90.50/90.71	Time used: 0.036002
90.50/90.71	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030464s
90.50/90.71	Time used: 0.029538
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003132s
90.50/90.71	Time used: 4.002
90.50/90.71	Solving with 2 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016202s
90.50/90.71	Time used: 4.00122
90.50/90.71	Solving with 3 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007999s
90.50/90.71	Time used: 1.00004
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.082576s
90.50/90.71	Time used: 0.070652
90.50/90.71	Improving Solution with cost 1 ...
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetNextSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001457s
90.50/90.71	Time used: 1.00136
90.50/90.71	
90.50/90.71	LOG: SAT solveNonLinear - Elapsed time: 1.084033s
90.50/90.71	Cost: 1; Total time: 1.07201
90.50/90.71	Termination implied by a set of invariant(s):
90.50/90.71	Invariant at l2: arg2 <= arg1
90.50/90.71	[ Invariant Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg2 <= arg1 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ arg2 <= arg1 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ arg1 <= 1 + arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	[ Termination Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg2 <= arg1 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ arg2 <= arg1 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg1 <= 1 + arg2 /\ 2 <= arg3 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Quasi-ranking function: 50000 + arg1 - 50002*arg2
90.50/90.71	New Graphs: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, arg2 <= arg1 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	<l2, l2, arg1 <= arg3 /\ arg2 <= arg1 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg1 <= 1 + arg2 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Variables:
90.50/90.71	arg1, arg2, arg3
90.50/90.71	Checking conditional termination of SCC {l2}...
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 0.008975s
90.50/90.71	
90.50/90.71	LOG: CALL solveLinear
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear - Elapsed time: 1.333808s
90.50/90.71	Trying to remove transition: <l2, l2, arg1 <= arg3 /\ arg2 <= arg1 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ arg1 <= 1 + arg2 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049490s
90.50/90.71	Time used: 0.0486
90.50/90.71	Trying to remove transition: <l2, l2, arg2 <= arg1 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ arg1 <= 1 + arg2 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041019s
90.50/90.71	Time used: 0.039993
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.034431s
90.50/90.71	Time used: 4.03324
90.50/90.71	Solving with 2 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009202s
90.50/90.71	Time used: 4.00128
90.50/90.71	Solving with 3 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008062s
90.50/90.71	Time used: 1.00017
90.50/90.71	Solving with 1 template(s).
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062990s
90.50/90.71	Time used: 0.051238
90.50/90.71	Improving Solution with cost 1 ...
90.50/90.71	
90.50/90.71	LOG: CALL solveNonLinearGetNextSolution
90.50/90.71	
90.50/90.71	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001108s
90.50/90.71	Time used: 1.00103
90.50/90.71	
90.50/90.71	LOG: SAT solveNonLinear - Elapsed time: 1.064098s
90.50/90.71	Cost: 1; Total time: 1.05227
90.50/90.71	Termination implied by a set of invariant(s):
90.50/90.71	Invariant at l2: arg1 <= arg2
90.50/90.71	[ Invariant Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	[ Termination Graph ]
90.50/90.71	Strengthening and disabling transitions...
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.71	
90.50/90.71	LOG: CALL solverLinear in Graph for feasibility
90.50/90.71	
90.50/90.71	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.71	Strengthening transition (result): 
90.50/90.71	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.71	Quasi-ranking function: 50000 - arg1
90.50/90.71	New Graphs: 
90.50/90.71	Transitions:
90.50/90.71	<l2, l2, 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	Variables:
90.50/90.72	arg1, arg2, arg3
90.50/90.72	Checking conditional termination of SCC {l2}...
90.50/90.72	
90.50/90.72	LOG: CALL solveLinear
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear - Elapsed time: 0.002609s
90.50/90.72	
90.50/90.72	LOG: CALL solveLinear
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear - Elapsed time: 0.191635s
90.50/90.72	Trying to remove transition: <l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033942s
90.50/90.72	Time used: 0.033273
90.50/90.72	Trying to remove transition: <l2, l2, 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028330s
90.50/90.72	Time used: 0.027305
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002980s
90.50/90.72	Time used: 4.0018
90.50/90.72	Solving with 2 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009832s
90.50/90.72	Time used: 4.00118
90.50/90.72	Solving with 3 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007792s
90.50/90.72	Time used: 1.00002
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058616s
90.50/90.72	Time used: 0.046166
90.50/90.72	Improving Solution with cost 1 ...
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetNextSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001601s
90.50/90.72	Time used: 1.00104
90.50/90.72	
90.50/90.72	LOG: SAT solveNonLinear - Elapsed time: 1.060218s
90.50/90.72	Cost: 1; Total time: 1.04721
90.50/90.72	Termination implied by a set of invariant(s):
90.50/90.72	Invariant at l2: 1 <= arg2
90.50/90.72	[ Invariant Graph ]
90.50/90.72	Strengthening and disabling transitions...
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	[ Termination Graph ]
90.50/90.72	Strengthening and disabling transitions...
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	Quasi-ranking function: 50000 - 2*arg1 + arg2
90.50/90.72	New Graphs: 
90.50/90.72	Transitions:
90.50/90.72	<l2, l2, 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	Variables:
90.50/90.72	arg1, arg2, arg3
90.50/90.72	Checking conditional termination of SCC {l2}...
90.50/90.72	
90.50/90.72	LOG: CALL solveLinear
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear - Elapsed time: 0.002959s
90.50/90.72	
90.50/90.72	LOG: CALL solveLinear
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear - Elapsed time: 0.156458s
90.50/90.72	Trying to remove transition: <l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 2 <= arg3 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031753s
90.50/90.72	Time used: 0.031034
90.50/90.72	Trying to remove transition: <l2, l2, 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0 /\ 50001 + arg1 <= 50002*arg2 /\ 50001 <= arg1 /\ 50001 <= arg1 + arg2 /\ 50001 + arg2 <= 2*arg1 /\ 50001 <= arg2 /\ arg1 = arg2, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035755s
90.50/90.72	Time used: 0.03473
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004837s
90.50/90.72	Time used: 4.00362
90.50/90.72	Solving with 2 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010581s
90.50/90.72	Time used: 4.00119
90.50/90.72	Solving with 3 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007928s
90.50/90.72	Time used: 1.00002
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014382s
90.50/90.72	Time used: 4.00246
90.50/90.72	
90.50/90.72	Proving non-termination of subgraph 1
90.50/90.72	Transitions:
90.50/90.72	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	Variables:
90.50/90.72	arg1, arg2, arg3
90.50/90.72	
90.50/90.72	Checking conditional non-termination of SCC {l2}...
90.50/90.72	EXIT TRANSITIONS:
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg2 <= 0 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg2 <= 0 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ arg3 <= 1, {all remain the same}>
90.50/90.72	<l2, end, arg2 <= 0 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg2 <= 0 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= arg3 /\ arg2 <= 0 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= arg3 /\ arg2 <= 0 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg3 <= arg2 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg2 <= 0 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg2 <= 0 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 + arg2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg2 <= 0 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ arg3 <= 1, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg2 <= 0 /\ 0 <= arg3 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg2 <= 0 /\ 1 + arg2 + arg3 <= 0 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.145340s
90.50/90.72	Time used: 0.144697
90.50/90.72	Improving Solution with cost 18 ...
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetNextSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.667172s
90.50/90.72	Time used: 0.667128
90.50/90.72	
90.50/90.72	LOG: SAT solveNonLinear - Elapsed time: 0.812512s
90.50/90.72	Cost: 18; Total time: 0.811825
90.50/90.72	Non-termination implied by a set of quasi-invariant(s):
90.50/90.72	Quasi-invariant at l2: 1 <= arg2
90.50/90.72	
90.50/90.72	Strengthening and disabling EXIT transitions...
90.50/90.72	Closed exits from l2: 11
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= 0 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= 0 /\ arg3 <= arg2 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	
90.50/90.72	Strengthening and disabling transitions...
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	Checking conditional non-termination of SCC {l2}...
90.50/90.72	EXIT TRANSITIONS:
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg3 <= arg2 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= 0 /\ arg1 <= arg3 /\ arg3 <= arg2 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041110s
90.50/90.72	Time used: 0.040633
90.50/90.72	Improving Solution with cost 3 ...
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetNextSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.092650s
90.50/90.72	Time used: 0.092638
90.50/90.72	
90.50/90.72	LOG: SAT solveNonLinear - Elapsed time: 0.133759s
90.50/90.72	Cost: 3; Total time: 0.133271
90.50/90.72	Non-termination implied by a set of quasi-invariant(s):
90.50/90.72	Quasi-invariant at l2: 1 <= arg1
90.50/90.72	
90.50/90.72	Strengthening and disabling EXIT transitions...
90.50/90.72	Closed exits from l2: 6
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	Strengthening exit transition (result): 
90.50/90.72	<l2, end, arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	
90.50/90.72	Strengthening and disabling transitions...
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, arg1 <= arg3 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	LOG: CALL solverLinear in Graph for feasibility
90.50/90.72	
90.50/90.72	LOG: RETURN solveLinear in Graph for feasibility
90.50/90.72	Strengthening transition (result): 
90.50/90.72	<l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}>
90.50/90.72	
90.50/90.72	Checking conditional non-termination of SCC {l2}...
90.50/90.72	EXIT TRANSITIONS:
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	<l2, end, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, arg1 <= arg3 /\ arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	
90.50/90.72	Solving with 1 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047787s
90.50/90.72	Time used: 0.047677
90.50/90.72	Solving with 2 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.003410s
90.50/90.72	Time used: 5.00186
90.50/90.72	Solving with 3 template(s).
90.50/90.72	
90.50/90.72	LOG: CALL solveNonLinearGetFirstSolution
90.50/90.72	
90.50/90.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.007045s
90.50/90.72	Time used: 5.00004
90.50/90.72	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
90.50/90.72	Calling reachability with...
90.50/90.72	Transition: <l2, end, true, {all remain the same}>
90.50/90.72	Conditions: arg3 <= arg2, 1 + arg2 + arg3 <= 0, 1 + arg3 <= 0, 1 <= arg1, 1 + arg3 <= arg1, 1 <= arg2, 
90.50/90.72	Transition: <l2, end, true, {all remain the same}>
90.50/90.72	Conditions: 1 + arg2 <= arg3, 0 <= arg2 + arg3, 0 <= arg3, 1 <= arg1, 1 <= arg2, 
90.50/90.72	OPEN EXITS: 
90.50/90.72	<l2, end, arg3 <= arg2 /\ 1 <= arg1 /\ 1 + arg3 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {all remain the same}>
90.50/90.72	<l2, end, 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2, {all remain the same}>
90.50/90.72	
90.50/90.72	--- Reachability graph ---
90.50/90.72	> Graph without transitions.
90.50/90.72	
90.50/90.72	Calling reachability with...
90.50/90.72	Transition: <l0, l2, 0 <= undef20 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.72	Conditions: arg3 <= arg2, 1 <= arg1, 1 + arg3 <= arg1, 1 + arg2 + arg3 <= 0, 1 <= arg2, 1 + arg3 <= 0, 
90.50/90.72	Transition: <l0, l2, 0 <= undef20 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.72	Conditions: 0 <= arg2 + arg3, 0 <= arg3, 1 <= arg1, 1 + arg2 <= arg3, 1 <= arg2, 
90.50/90.72	OPEN EXITS: 
90.50/90.72	<l0, l2, 0 <= arg2 + arg3 /\ 0 <= arg3 /\ 0 <= undef20 /\ 1 + arg2 <= arg3 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}>
90.50/90.72	
90.50/90.72	> Conditions are reachable!
90.50/90.72	
90.50/90.72	Program does NOT terminate
90.50/90.72	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
90.50/90.72	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
90.50/90.72	EOF