1.01/1.06	YES
1.01/1.06	
1.01/1.06	Solver Timeout: 4
1.01/1.06	Global Timeout: 300
1.01/1.06	No parsing errors!
1.01/1.06	Init Location: 0
1.01/1.06	Transitions:
1.01/1.06	<l0, l4, true>
1.01/1.06	<l1, l2, (1 <= (0 + x^0)) /\ (undef4 = ((0 + i^0) + y^0)), par{i^0 -> (1 + i^0), x^0 -> ((0 + x^0) + (~(1) * undef4)), z^0 -> undef4}>
1.01/1.06	<l2, l1, true>
1.01/1.06	<l3, l1, (undef11 = undef11), par{i^0 -> 0, y^0 -> undef11}>
1.01/1.06	<l4, l3, true>
1.01/1.06	
1.01/1.06	Fresh variables:
1.01/1.06	undef4, undef11, 
1.01/1.06	
1.01/1.06	Undef variables:
1.01/1.06	undef4, undef11, 
1.01/1.06	
1.01/1.06	Abstraction variables:
1.01/1.06	
1.01/1.06	Exit nodes:
1.01/1.06	
1.01/1.06	Accepting locations:
1.01/1.06	
1.01/1.06	Asserts:
1.01/1.06	
1.01/1.06	Preprocessed LLVMGraph
1.01/1.06	Init Location: 0
1.01/1.06	Transitions:
1.01/1.06	<l0, l1, (i^0 = 0) /\ (y^0 = undef11) /\ (undef11 = undef11)>
1.01/1.06	<l1, l1, (1 <= (0 + x^0)) /\ (undef4 = ((0 + i^0) + y^0)), par{i^0 -> (1 + i^0), x^0 -> ((0 + x^0) + (~(1) * undef4))}>
1.01/1.06	
1.01/1.06	Fresh variables:
1.01/1.06	undef4, undef11, 
1.01/1.06	
1.01/1.06	Undef variables:
1.01/1.06	undef4, undef11, 
1.01/1.06	
1.01/1.06	Abstraction variables:
1.01/1.06	
1.01/1.06	Exit nodes:
1.01/1.06	
1.01/1.06	Accepting locations:
1.01/1.06	
1.01/1.06	Asserts:
1.01/1.06	
1.01/1.06	*************************************************************
1.01/1.06	*******************************************************************************************
1.01/1.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.01/1.06	*******************************************************************************************
1.01/1.06	
1.01/1.06	Init Location: 0
1.01/1.06	Graph 0:
1.01/1.06	Transitions:
1.01/1.06	Variables:
1.01/1.06	
1.01/1.06	Graph 1:
1.01/1.06	Transitions:
1.01/1.06	<l1, l1, 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
1.01/1.06	Variables:
1.01/1.06	i^0, x^0, y^0
1.01/1.06	
1.01/1.06	Precedence: 
1.01/1.06	Graph 0
1.01/1.06	
1.01/1.06	Graph 1
1.01/1.06	<l0, l1, i^0 = 0 /\ y^0 = undef11, {all remain the same}>
1.01/1.06	
1.01/1.06	Map Locations to Subgraph:
1.01/1.06	( 0 , 0 )
1.01/1.06	( 1 , 1 )
1.01/1.06	
1.01/1.06	*******************************************************************************************
1.01/1.06	********************************    CHECKING ASSERTIONS    ********************************
1.01/1.06	*******************************************************************************************
1.01/1.06	
1.01/1.06	Proving termination of subgraph 0
1.01/1.06	Proving termination of subgraph 1
1.01/1.06	Checking unfeasibility...
1.01/1.06	Time used: 0.002555
1.01/1.06	
1.01/1.06	Checking conditional termination of SCC {l1}...
1.01/1.06	
1.01/1.06	LOG: CALL solveLinear
1.01/1.06	
1.01/1.06	LOG: RETURN solveLinear - Elapsed time: 0.000966s
1.01/1.06	
1.01/1.06	LOG: CALL solveLinear
1.01/1.06	
1.01/1.06	LOG: RETURN solveLinear - Elapsed time: 0.002663s
1.01/1.06	Trying to remove transition: <l1, l1, 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
1.01/1.06	Solving with 1 template(s).
1.01/1.06	
1.01/1.06	LOG: CALL solveNonLinearGetFirstSolution
1.01/1.06	
1.01/1.06	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008545s
1.01/1.06	Time used: 0.008362
1.01/1.06	Solving with 1 template(s).
1.01/1.06	
1.01/1.06	LOG: CALL solveNonLinearGetFirstSolution
1.01/1.06	
1.01/1.06	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012087s
1.01/1.06	Time used: 0.011553
1.01/1.06	Improving Solution with cost 1 ...
1.01/1.06	
1.01/1.06	LOG: CALL solveNonLinearGetNextSolution
1.01/1.06	
1.01/1.06	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000537s
1.01/1.06	Time used: 1.00037
1.01/1.06	
1.01/1.06	LOG: SAT solveNonLinear - Elapsed time: 1.012624s
1.01/1.06	Cost: 1; Total time: 1.01192
1.01/1.06	Failed at location 1: 1 <= i^0 + y^0
1.01/1.06	Before Improving: 
1.01/1.06	Quasi-invariant at l1: 1 <= i^0 + y^0
1.01/1.06	Optimizing invariants...
1.01/1.06	
1.01/1.06	LOG: CALL solveLinear
1.01/1.06	
1.01/1.06	LOG: RETURN solveLinear - Elapsed time: 0.005957s
1.01/1.06	Remaining time after improvement: 0.998657
1.01/1.06	Termination implied by a set of quasi-invariant(s):
1.01/1.06	Quasi-invariant at l1: 1 <= i^0 + y^0
1.01/1.06	[ Invariant Graph ]
1.01/1.06	Strengthening and disabling transitions...
1.01/1.06	
1.01/1.06	LOG: CALL solverLinear in Graph for feasibility
1.01/1.06	
1.01/1.06	LOG: RETURN solveLinear in Graph for feasibility
1.01/1.06	Strengthening transition (result): 
1.01/1.06	<l1, l1, 1 <= i^0 + y^0 /\ 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
1.01/1.06	[ Termination Graph ]
1.01/1.06	Strengthening and disabling transitions...
1.01/1.06	
1.01/1.06	LOG: CALL solverLinear in Graph for feasibility
1.01/1.06	
1.01/1.06	LOG: RETURN solveLinear in Graph for feasibility
1.01/1.06	Strengthening transition (result): 
1.01/1.06	<l1, l1, 1 <= i^0 + y^0 /\ 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
1.01/1.06	Ranking function: 2 + i^0 + 2*x^0 + y^0
1.01/1.06	New Graphs: 
1.01/1.06	Calling Safety with literal 1 <= i^0 + y^0 and entry <l0, l1, i^0 = 0 /\ y^0 = undef11, {all remain the same}>
1.01/1.06	
1.01/1.06	LOG: CALL check - Post:1 <= i^0 + y^0 - Process 1
1.01/1.06	* Exit transition: <l0, l1, i^0 = 0 /\ y^0 = undef11, {all remain the same}>
1.01/1.06	* Postcondition  : 1 <= i^0 + y^0
1.01/1.06	
1.01/1.06	LOG: CALL solveLinear
1.01/1.06	
1.01/1.06	LOG: RETURN solveLinear - Elapsed time: 0.000468s
1.01/1.06	> Postcondition is not implied!
1.01/1.06	
1.01/1.06	LOG: RETURN check - Elapsed time: 0.000586s
1.01/1.06	INVARIANTS: 
1.01/1.06	1: 
1.01/1.06	Quasi-INVARIANTS to narrow Graph: 
1.01/1.06	1: 1 <= i^0 + y^0 , 
1.01/1.06	Narrowing transition: 
1.01/1.06	<l1, l1, 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
1.01/1.06	
1.01/1.06	LOG: Narrow transition size 1
1.01/1.06	invGraph after Narrowing: 
1.01/1.06	Transitions:
1.01/1.06	<l1, l1, 1 <= x^0 /\ i^0 + y^0 <= 0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
1.01/1.06	Variables:
1.01/1.06	i^0, x^0, y^0
1.01/1.06	Checking conditional termination of SCC {l1}...
1.01/1.06	
1.01/1.06	LOG: CALL solveLinear
1.01/1.06	
1.01/1.06	LOG: RETURN solveLinear - Elapsed time: 0.000879s
1.01/1.06	Ranking function: -i^0 - y^0
1.01/1.06	New Graphs: 
1.01/1.06	Program Terminates
1.01/1.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
1.01/1.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
1.01/1.06	EOF