0.00/0.08	YES
0.00/0.08	
0.00/0.08	Solver Timeout: 4
0.00/0.08	Global Timeout: 300
0.00/0.08	No parsing errors!
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l4, true>
0.00/0.08	<l1, l2, (1 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0)), y^0 -> (1 + y^0)}>
0.00/0.08	<l2, l1, true>
0.00/0.08	<l3, l1, true>
0.00/0.08	<l4, l3, true>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	Preprocessed LLVMGraph
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l1, true>
0.00/0.08	<l1, l1, (1 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0)), y^0 -> (1 + y^0)}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	*************************************************************
0.00/0.08	*******************************************************************************************
0.00/0.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Graph 0:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 1:
0.00/0.08	Transitions:
0.00/0.08	<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	x^0, y^0
0.00/0.08	
0.00/0.08	Precedence: 
0.00/0.08	Graph 0
0.00/0.08	
0.00/0.08	Graph 1
0.00/0.08	<l0, l1, true, {all remain the same}>
0.00/0.08	
0.00/0.08	Map Locations to Subgraph:
0.00/0.08	( 0 , 0 )
0.00/0.08	( 1 , 1 )
0.00/0.08	
0.00/0.08	*******************************************************************************************
0.00/0.08	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Proving termination of subgraph 0
0.00/0.08	Proving termination of subgraph 1
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.001842
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l1}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000697s
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001679s
0.00/0.08	Trying to remove transition: <l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.08	Solving with 1 template(s).
0.00/0.08	
0.00/0.08	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.08	
0.00/0.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005530s
0.00/0.08	Time used: 0.005397
0.00/0.08	Solving with 1 template(s).
0.00/0.08	
0.00/0.08	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.08	
0.00/0.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005593s
0.00/0.08	Time used: 0.005267
0.00/0.08	Improving Solution with cost 1 ...
0.00/0.08	
0.00/0.08	LOG: CALL solveNonLinearGetNextSolution
0.00/0.08	
0.00/0.08	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011173s
0.00/0.08	Time used: 0.011168
0.00/0.08	
0.00/0.08	LOG: SAT solveNonLinear - Elapsed time: 0.016766s
0.00/0.08	Cost: 1; Total time: 0.016435
0.00/0.08	Failed at location 1: x^0 <= 0
0.00/0.08	Before Improving: 
0.00/0.08	Quasi-invariant at l1: x^0 <= 0
0.00/0.08	Optimizing invariants...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001623s
0.00/0.08	Remaining time after improvement: 0.999269
0.00/0.08	Termination implied by a set of quasi-invariant(s):
0.00/0.08	Quasi-invariant at l1: x^0 <= 0
0.00/0.08	[ Invariant Graph ]
0.00/0.08	Strengthening and disabling transitions...
0.00/0.08	
0.00/0.08	LOG: CALL solverLinear in Graph for feasibility
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.08	It's unfeasible. Removing transition: 
0.00/0.08	<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.08	[ Termination Graph ]
0.00/0.08	Strengthening and disabling transitions...
0.00/0.08	
0.00/0.08	LOG: CALL solverLinear in Graph for feasibility
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.08	It's unfeasible. Removing transition: 
0.00/0.08	<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.08	New Graphs: 
0.00/0.08	Calling Safety with literal x^0 <= 0 and entry <l0, l1, true, {all remain the same}>
0.00/0.08	
0.00/0.08	LOG: CALL check - Post:x^0 <= 0 - Process 1
0.00/0.08	* Exit transition: <l0, l1, true, {all remain the same}>
0.00/0.08	* Postcondition  : x^0 <= 0
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000290s
0.00/0.08	> Postcondition is not implied!
0.00/0.08	
0.00/0.08	LOG: RETURN check - Elapsed time: 0.000354s
0.00/0.08	INVARIANTS: 
0.00/0.08	1: 
0.00/0.08	Quasi-INVARIANTS to narrow Graph: 
0.00/0.08	1: x^0 <= 0 , 
0.00/0.08	Narrowing transition: 
0.00/0.08	<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.08	
0.00/0.08	LOG: Narrow transition size 1
0.00/0.08	invGraph after Narrowing: 
0.00/0.08	Transitions:
0.00/0.08	<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	x^0, y^0
0.00/0.08	Checking conditional termination of SCC {l1}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000638s
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001631s
0.00/0.08	Trying to remove transition: <l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.08	Solving with 1 template(s).
0.00/0.08	
0.00/0.08	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.08	
0.00/0.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004963s
0.00/0.08	Time used: 0.004838
0.00/0.08	Solving with 1 template(s).
0.00/0.08	
0.00/0.08	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.08	
0.00/0.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006694s
0.00/0.08	Time used: 0.006332
0.00/0.08	Improving Solution with cost 1 ...
0.00/0.08	
0.00/0.08	LOG: CALL solveNonLinearGetNextSolution
0.00/0.08	
0.00/0.08	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014877s
0.00/0.08	Time used: 0.014871
0.00/0.08	
0.00/0.08	LOG: SAT solveNonLinear - Elapsed time: 0.021570s
0.00/0.08	Cost: 1; Total time: 0.021203
0.00/0.08	Failed at location 1: 1 <= y^0
0.00/0.08	Before Improving: 
0.00/0.08	Quasi-invariant at l1: 1 <= y^0
0.00/0.08	Optimizing invariants...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.001578s
0.00/0.09	Remaining time after improvement: 0.999297
0.00/0.09	Termination implied by a set of quasi-invariant(s):
0.00/0.09	Quasi-invariant at l1: 1 <= y^0
0.00/0.09	[ Invariant Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l1, l1, 1 <= x^0 /\ 1 <= y^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.09	[ Termination Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l1, l1, 1 <= x^0 /\ 1 <= y^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.09	Ranking function: x^0
0.00/0.09	New Graphs: 
0.00/0.09	Calling Safety with literal 1 <= y^0 and entry <l0, l1, 1 <= x^0, {all remain the same}>
0.00/0.09	
0.00/0.09	LOG: CALL check - Post:1 <= y^0 - Process 2
0.00/0.09	* Exit transition: <l0, l1, 1 <= x^0, {all remain the same}>
0.00/0.09	* Postcondition  : 1 <= y^0
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000301s
0.00/0.09	> Postcondition is not implied!
0.00/0.09	
0.00/0.09	LOG: RETURN check - Elapsed time: 0.000371s
0.00/0.09	INVARIANTS: 
0.00/0.09	1: 
0.00/0.09	Quasi-INVARIANTS to narrow Graph: 
0.00/0.09	1: 1 <= y^0 , 
0.00/0.09	Narrowing transition: 
0.00/0.09	<l1, l1, 1 <= x^0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.09	
0.00/0.09	LOG: Narrow transition size 1
0.00/0.09	invGraph after Narrowing: 
0.00/0.09	Transitions:
0.00/0.09	<l1, l1, 1 <= x^0 /\ y^0 <= 0, {x^0 -> x^0 - y^0, y^0 -> 1 + y^0, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	x^0, y^0
0.00/0.09	Checking conditional termination of SCC {l1}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000787s
0.00/0.09	Ranking function: -y^0
0.00/0.09	New Graphs: 
0.00/0.09	Program Terminates
0.00/0.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.09	EOF