5.20/5.28	NO
5.20/5.28	
5.20/5.28	Solver Timeout: 4
5.20/5.28	Global Timeout: 300
5.20/5.28	No parsing errors!
5.20/5.28	Init Location: 0
5.20/5.28	Transitions:
5.20/5.28	<l0, l4, true>
5.20/5.28	<l1, l2, (0 <= (0 + x^0)) /\ ((0 + t^0) <= (0 + y^0)), par{x^0 -> ((0 + x^0) + y^0)}>
5.20/5.28	<l2, l1, true>
5.20/5.28	<l3, l1, (undef10 = ~(1)) /\ (undef11 = (~(1) + undef10)) /\ (undef12 = (~(1) + undef11)) /\ (undef13 = (~(1) + undef12)) /\ (undef14 = (~(1) + undef13)) /\ (undef15 = (~(1) + undef14)) /\ (undef16 = (~(1) + undef15)) /\ (undef17 = (~(1) + undef16)) /\ (undef18 = (~(1) + undef17)) /\ (undef7 = (~(1) + undef18)) /\ (~(1) <= (0 + x^0)) /\ ((0 + undef7) <= (0 + y^0)), par{t^0 -> undef7}>
5.20/5.28	<l4, l3, true>
5.20/5.28	
5.20/5.28	Fresh variables:
5.20/5.28	undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
5.20/5.28	
5.20/5.28	Undef variables:
5.20/5.28	undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
5.20/5.28	
5.20/5.28	Abstraction variables:
5.20/5.28	
5.20/5.28	Exit nodes:
5.20/5.28	
5.20/5.28	Accepting locations:
5.20/5.28	
5.20/5.28	Asserts:
5.20/5.28	
5.20/5.28	Preprocessed LLVMGraph
5.20/5.28	Init Location: 0
5.20/5.28	Transitions:
5.20/5.28	<l0, l1, (t^0 = undef7) /\ (undef10 = ~(1)) /\ (undef11 = (~(1) + undef10)) /\ (undef12 = (~(1) + undef11)) /\ (undef13 = (~(1) + undef12)) /\ (undef14 = (~(1) + undef13)) /\ (undef15 = (~(1) + undef14)) /\ (undef16 = (~(1) + undef15)) /\ (undef17 = (~(1) + undef16)) /\ (undef18 = (~(1) + undef17)) /\ (undef7 = (~(1) + undef18)) /\ (~(1) <= (0 + x^0)) /\ ((0 + undef7) <= (0 + y^0))>
5.20/5.28	<l1, l1, (0 <= (0 + x^0)) /\ ((0 + t^0) <= (0 + y^0)), par{x^0 -> ((0 + x^0) + y^0)}>
5.20/5.28	
5.20/5.28	Fresh variables:
5.20/5.28	undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
5.20/5.28	
5.20/5.28	Undef variables:
5.20/5.28	undef7, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
5.20/5.28	
5.20/5.28	Abstraction variables:
5.20/5.28	
5.20/5.28	Exit nodes:
5.20/5.28	
5.20/5.28	Accepting locations:
5.20/5.28	
5.20/5.28	Asserts:
5.20/5.28	
5.20/5.28	*************************************************************
5.20/5.28	*******************************************************************************************
5.20/5.28	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.20/5.28	*******************************************************************************************
5.20/5.28	
5.20/5.28	Init Location: 0
5.20/5.28	Graph 0:
5.20/5.28	Transitions:
5.20/5.28	Variables:
5.20/5.28	
5.20/5.28	Graph 1:
5.20/5.28	Transitions:
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Variables:
5.20/5.28	t^0, x^0, y^0
5.20/5.28	
5.20/5.28	Precedence: 
5.20/5.28	Graph 0
5.20/5.28	
5.20/5.28	Graph 1
5.20/5.28	<l0, l1, undef7 <= y^0 /\ 0 <= 1 + x^0 /\ t^0 = undef7 /\ 1 + undef7 = undef18 /\ 1 + undef10 = 0 /\ undef10 = 1 + undef11 /\ undef11 = 1 + undef12 /\ undef12 = 1 + undef13 /\ undef13 = 1 + undef14 /\ undef14 = 1 + undef15 /\ undef15 = 1 + undef16 /\ undef16 = 1 + undef17 /\ undef17 = 1 + undef18, {all remain the same}>
5.20/5.28	
5.20/5.28	Map Locations to Subgraph:
5.20/5.28	( 0 , 0 )
5.20/5.28	( 1 , 1 )
5.20/5.28	
5.20/5.28	*******************************************************************************************
5.20/5.28	********************************    CHECKING ASSERTIONS    ********************************
5.20/5.28	*******************************************************************************************
5.20/5.28	
5.20/5.28	Proving termination of subgraph 0
5.20/5.28	Proving termination of subgraph 1
5.20/5.28	Checking unfeasibility...
5.20/5.28	Time used: 0.003119
5.20/5.28	
5.20/5.28	Checking conditional termination of SCC {l1}...
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.000792s
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.001957s
5.20/5.28	Trying to remove transition: <l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005959s
5.20/5.28	Time used: 0.005788
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010224s
5.20/5.28	Time used: 0.00974
5.20/5.28	Improving Solution with cost 1 ...
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetNextSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018923s
5.20/5.28	Time used: 0.018919
5.20/5.28	
5.20/5.28	LOG: SAT solveNonLinear - Elapsed time: 0.029147s
5.20/5.28	Cost: 1; Total time: 0.028659
5.20/5.28	Failed at location 1: 1 + x^0 <= 0
5.20/5.28	Before Improving: 
5.20/5.28	Quasi-invariant at l1: 1 + x^0 <= 0
5.20/5.28	Optimizing invariants...
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.003313s
5.20/5.28	Remaining time after improvement: 0.99818
5.20/5.28	Termination implied by a set of quasi-invariant(s):
5.20/5.28	Quasi-invariant at l1: 1 + x^0 <= 0
5.20/5.28	[ Invariant Graph ]
5.20/5.28	Strengthening and disabling transitions...
5.20/5.28	
5.20/5.28	LOG: CALL solverLinear in Graph for feasibility
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear in Graph for feasibility
5.20/5.28	It's unfeasible. Removing transition: 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	[ Termination Graph ]
5.20/5.28	Strengthening and disabling transitions...
5.20/5.28	> It's unfeasible. Removing transition: 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	New Graphs: 
5.20/5.28	Calling Safety with literal 1 + x^0 <= 0 and entry <l0, l1, undef7 <= y^0 /\ 0 <= 1 + x^0 /\ t^0 = undef7 /\ 1 + undef7 = undef18 /\ 1 + undef10 = 0 /\ undef10 = 1 + undef11 /\ undef11 = 1 + undef12 /\ undef12 = 1 + undef13 /\ undef13 = 1 + undef14 /\ undef14 = 1 + undef15 /\ undef15 = 1 + undef16 /\ undef16 = 1 + undef17 /\ undef17 = 1 + undef18, {all remain the same}>
5.20/5.28	
5.20/5.28	LOG: CALL check - Post:1 + x^0 <= 0 - Process 1
5.20/5.28	* Exit transition: <l0, l1, undef7 <= y^0 /\ 0 <= 1 + x^0 /\ t^0 = undef7 /\ 1 + undef7 = undef18 /\ 1 + undef10 = 0 /\ undef10 = 1 + undef11 /\ undef11 = 1 + undef12 /\ undef12 = 1 + undef13 /\ undef13 = 1 + undef14 /\ undef14 = 1 + undef15 /\ undef15 = 1 + undef16 /\ undef16 = 1 + undef17 /\ undef17 = 1 + undef18, {all remain the same}>
5.20/5.28	* Postcondition  : 1 + x^0 <= 0
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.001358s
5.20/5.28	> Postcondition is not implied!
5.20/5.28	
5.20/5.28	LOG: RETURN check - Elapsed time: 0.001555s
5.20/5.28	INVARIANTS: 
5.20/5.28	1: 
5.20/5.28	Quasi-INVARIANTS to narrow Graph: 
5.20/5.28	1: 1 + x^0 <= 0 , 
5.20/5.28	Narrowing transition: 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	
5.20/5.28	LOG: Narrow transition size 1
5.20/5.28	invGraph after Narrowing: 
5.20/5.28	Transitions:
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Variables:
5.20/5.28	t^0, x^0, y^0
5.20/5.28	Checking conditional termination of SCC {l1}...
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.000691s
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.001963s
5.20/5.28	Trying to remove transition: <l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005113s
5.20/5.28	Time used: 0.004971
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011632s
5.20/5.28	Time used: 0.011106
5.20/5.28	Improving Solution with cost 1 ...
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetNextSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016342s
5.20/5.28	Time used: 0.016338
5.20/5.28	
5.20/5.28	LOG: SAT solveNonLinear - Elapsed time: 0.027973s
5.20/5.28	Cost: 1; Total time: 0.027444
5.20/5.28	Failed at location 1: 1 + y^0 <= 0
5.20/5.28	Before Improving: 
5.20/5.28	Quasi-invariant at l1: 1 + y^0 <= 0
5.20/5.28	Optimizing invariants...
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.003129s
5.20/5.28	Remaining time after improvement: 0.998214
5.20/5.28	Termination implied by a set of quasi-invariant(s):
5.20/5.28	Quasi-invariant at l1: 1 + y^0 <= 0
5.20/5.28	[ Invariant Graph ]
5.20/5.28	Strengthening and disabling transitions...
5.20/5.28	
5.20/5.28	LOG: CALL solverLinear in Graph for feasibility
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear in Graph for feasibility
5.20/5.28	Strengthening transition (result): 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0 /\ 1 + y^0 <= 0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	[ Termination Graph ]
5.20/5.28	Strengthening and disabling transitions...
5.20/5.28	
5.20/5.28	LOG: CALL solverLinear in Graph for feasibility
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear in Graph for feasibility
5.20/5.28	Strengthening transition (result): 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0 /\ 1 + y^0 <= 0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Ranking function: -t^0 + x^0
5.20/5.28	New Graphs: 
5.20/5.28	Calling Safety with literal 1 + y^0 <= 0 and entry <l0, l1, 0 <= x^0 /\ undef7 <= y^0 /\ t^0 = undef7 /\ 1 + undef7 = undef18 /\ 1 + undef10 = 0 /\ undef10 = 1 + undef11 /\ undef11 = 1 + undef12 /\ undef12 = 1 + undef13 /\ undef13 = 1 + undef14 /\ undef14 = 1 + undef15 /\ undef15 = 1 + undef16 /\ undef16 = 1 + undef17 /\ undef17 = 1 + undef18, {all remain the same}>
5.20/5.28	
5.20/5.28	LOG: CALL check - Post:1 + y^0 <= 0 - Process 2
5.20/5.28	* Exit transition: <l0, l1, 0 <= x^0 /\ undef7 <= y^0 /\ t^0 = undef7 /\ 1 + undef7 = undef18 /\ 1 + undef10 = 0 /\ undef10 = 1 + undef11 /\ undef11 = 1 + undef12 /\ undef12 = 1 + undef13 /\ undef13 = 1 + undef14 /\ undef14 = 1 + undef15 /\ undef15 = 1 + undef16 /\ undef16 = 1 + undef17 /\ undef17 = 1 + undef18, {all remain the same}>
5.20/5.28	* Postcondition  : 1 + y^0 <= 0
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.001284s
5.20/5.28	> Postcondition is not implied!
5.20/5.28	
5.20/5.28	LOG: RETURN check - Elapsed time: 0.001480s
5.20/5.28	INVARIANTS: 
5.20/5.28	1: 
5.20/5.28	Quasi-INVARIANTS to narrow Graph: 
5.20/5.28	1: 1 + y^0 <= 0 , 
5.20/5.28	Narrowing transition: 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	
5.20/5.28	LOG: Narrow transition size 1
5.20/5.28	invGraph after Narrowing: 
5.20/5.28	Transitions:
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0 /\ 0 <= y^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Variables:
5.20/5.28	t^0, x^0, y^0
5.20/5.28	Checking conditional termination of SCC {l1}...
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.000749s
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.002188s
5.20/5.28	Trying to remove transition: <l1, l1, t^0 <= y^0 /\ 0 <= x^0 /\ 0 <= y^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005284s
5.20/5.28	Time used: 0.005139
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010849s
5.20/5.28	Time used: 0.010453
5.20/5.28	Solving with 2 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001420s
5.20/5.28	Time used: 4.00092
5.20/5.28	Solving with 3 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004680s
5.20/5.28	Time used: 1.0001
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016753s
5.20/5.28	Time used: 0.008096
5.20/5.28	
5.20/5.28	Proving non-termination of subgraph 1
5.20/5.28	Transitions:
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0 /\ 0 <= y^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	Variables:
5.20/5.28	t^0, x^0, y^0
5.20/5.28	
5.20/5.28	Checking conditional non-termination of SCC {l1}...
5.20/5.28	EXIT TRANSITIONS:
5.20/5.28	<l1, end, 1 + y^0 <= t^0, {all remain the same}>
5.20/5.28	<l1, end, t^0 <= y^0 /\ 0 <= x^0 /\ 1 + y^0 <= 0, {all remain the same}>
5.20/5.28	<l1, end, t^0 <= y^0 /\ 1 + x^0 <= 0, {all remain the same}>
5.20/5.28	
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012983s
5.20/5.28	Time used: 0.012731
5.20/5.28	Improving Solution with cost 3 ...
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetNextSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016393s
5.20/5.28	Time used: 0.016386
5.20/5.28	
5.20/5.28	LOG: SAT solveNonLinear - Elapsed time: 0.029376s
5.20/5.28	Cost: 3; Total time: 0.029117
5.20/5.28	Non-termination implied by a set of quasi-invariant(s):
5.20/5.28	Quasi-invariant at l1: t^0 <= y^0
5.20/5.28	
5.20/5.28	Strengthening and disabling EXIT transitions...
5.20/5.28	Closed exits from l1: 1
5.20/5.28	Strengthening exit transition (result): 
5.20/5.28	<l1, end, t^0 <= y^0 /\ 0 <= x^0 /\ 1 + y^0 <= 0, {all remain the same}>
5.20/5.28	Strengthening exit transition (result): 
5.20/5.28	<l1, end, t^0 <= y^0 /\ 1 + x^0 <= 0, {all remain the same}>
5.20/5.28	
5.20/5.28	Strengthening and disabling transitions...
5.20/5.28	
5.20/5.28	LOG: CALL solverLinear in Graph for feasibility
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear in Graph for feasibility
5.20/5.28	Strengthening transition (result): 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ 0 <= x^0 /\ 0 <= y^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	
5.20/5.28	Checking conditional non-termination of SCC {l1}...
5.20/5.28	EXIT TRANSITIONS:
5.20/5.28	<l1, end, t^0 <= y^0 /\ 0 <= x^0 /\ 1 + y^0 <= 0, {all remain the same}>
5.20/5.28	<l1, end, t^0 <= y^0 /\ 1 + x^0 <= 0, {all remain the same}>
5.20/5.28	
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010117s
5.20/5.28	Time used: 0.009905
5.20/5.28	Improving Solution with cost 2 ...
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetNextSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020020s
5.20/5.28	Time used: 0.020015
5.20/5.28	
5.20/5.28	LOG: SAT solveNonLinear - Elapsed time: 0.030137s
5.20/5.28	Cost: 2; Total time: 0.02992
5.20/5.28	Failed at location 1: y^0 <= t^0 + x^0
5.20/5.28	Before Improving: 
5.20/5.28	Quasi-invariant at l1: y^0 <= t^0 + x^0
5.20/5.28	Optimizing invariants...
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.002424s
5.20/5.28	Remaining time after improvement: 0.99869
5.20/5.28	Non-termination implied by a set of quasi-invariant(s):
5.20/5.28	Quasi-invariant at l1: y^0 <= t^0 + x^0
5.20/5.28	
5.20/5.28	Strengthening and disabling EXIT transitions...
5.20/5.28	Closed exits from l1: 1
5.20/5.28	Strengthening exit transition (result): 
5.20/5.28	<l1, end, t^0 <= y^0 /\ y^0 <= t^0 + x^0 /\ 0 <= x^0 /\ 1 + y^0 <= 0, {all remain the same}>
5.20/5.28	
5.20/5.28	Strengthening and disabling transitions...
5.20/5.28	
5.20/5.28	LOG: CALL solverLinear in Graph for feasibility
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear in Graph for feasibility
5.20/5.28	Strengthening transition (result): 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ y^0 <= t^0 + x^0 /\ 0 <= x^0 /\ 0 <= y^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	
5.20/5.28	Checking conditional non-termination of SCC {l1}...
5.20/5.28	EXIT TRANSITIONS:
5.20/5.28	<l1, end, t^0 <= y^0 /\ y^0 <= t^0 + x^0 /\ 0 <= x^0 /\ 1 + y^0 <= 0, {all remain the same}>
5.20/5.28	
5.20/5.28	Solving with 1 template(s).
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetFirstSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008361s
5.20/5.28	Time used: 0.00812
5.20/5.28	Improving Solution with cost 1 ...
5.20/5.28	
5.20/5.28	LOG: CALL solveNonLinearGetNextSolution
5.20/5.28	
5.20/5.28	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009309s
5.20/5.28	Time used: 0.009306
5.20/5.28	
5.20/5.28	LOG: SAT solveNonLinear - Elapsed time: 0.017670s
5.20/5.28	Cost: 1; Total time: 0.017426
5.20/5.28	Failed at location 1: 0 <= y^0
5.20/5.28	Before Improving: 
5.20/5.28	Quasi-invariant at l1: 0 <= y^0
5.20/5.28	Optimizing invariants...
5.20/5.28	
5.20/5.28	LOG: CALL solveLinear
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear - Elapsed time: 0.002132s
5.20/5.28	Remaining time after improvement: 0.998713
5.20/5.28	Non-termination implied by a set of quasi-invariant(s):
5.20/5.28	Quasi-invariant at l1: 0 <= y^0
5.20/5.28	
5.20/5.28	Strengthening and disabling EXIT transitions...
5.20/5.28	Closed exits from l1: 1
5.20/5.28	
5.20/5.28	Strengthening and disabling transitions...
5.20/5.28	
5.20/5.28	LOG: CALL solverLinear in Graph for feasibility
5.20/5.28	
5.20/5.28	LOG: RETURN solveLinear in Graph for feasibility
5.20/5.28	Strengthening transition (result): 
5.20/5.28	<l1, l1, t^0 <= y^0 /\ y^0 <= t^0 + x^0 /\ 0 <= x^0 /\ 0 <= y^0, {x^0 -> x^0 + y^0, rest remain the same}>
5.20/5.28	
5.20/5.28	Calling reachability with...
5.20/5.28	Transition: <l1, end, true, {all remain the same}>
5.20/5.28	Conditions: t^0 <= y^0, y^0 <= t^0 + x^0, 0 <= y^0, 
5.20/5.28	OPEN EXITS: 
5.20/5.28	<l1, end, y^0 <= t^0 + x^0, {all remain the same}> (condsUp: t^0 <= y^0, 0 <= y^0)
5.20/5.28	
5.20/5.28	--- Reachability graph ---
5.20/5.28	> Graph without transitions.
5.20/5.28	
5.20/5.28	Calling reachability with...
5.20/5.28	Transition: <l0, l1, undef7 <= y^0 /\ 0 <= 1 + x^0 /\ t^0 = undef7 /\ 1 + undef7 = undef18 /\ 1 + undef10 = 0 /\ undef10 = 1 + undef11 /\ undef11 = 1 + undef12 /\ undef12 = 1 + undef13 /\ undef13 = 1 + undef14 /\ undef14 = 1 + undef15 /\ undef15 = 1 + undef16 /\ undef16 = 1 + undef17 /\ undef17 = 1 + undef18, {all remain the same}>
5.20/5.28	Conditions: y^0 <= t^0 + x^0, t^0 <= y^0, 0 <= y^0, 
5.20/5.28	OPEN EXITS: 
5.20/5.28	<l0, l1, t^0 <= y^0 /\ y^0 <= t^0 + x^0 /\ 0 <= y^0 /\ undef7 <= y^0 /\ 0 <= 1 + x^0 /\ t^0 = undef7 /\ 1 + undef7 = undef18 /\ 1 + undef10 = 0 /\ undef10 = 1 + undef11 /\ undef11 = 1 + undef12 /\ undef12 = 1 + undef13 /\ undef13 = 1 + undef14 /\ undef14 = 1 + undef15 /\ undef15 = 1 + undef16 /\ undef16 = 1 + undef17 /\ undef17 = 1 + undef18, {all remain the same}>
5.20/5.28	
5.20/5.28	> Conditions are reachable!
5.20/5.28	
5.20/5.28	Program does NOT terminate
5.20/5.28	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.20/5.28	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.20/5.28	EOF