4.98/5.07	NO
4.98/5.07	
4.98/5.07	Solver Timeout: 4
4.98/5.07	Global Timeout: 300
4.98/5.07	No parsing errors!
4.98/5.07	Init Location: 0
4.98/5.07	Transitions:
4.98/5.07	<l0, l4, true>
4.98/5.07	<l1, l2, ((0 + x^0) <= (0 + y^0)) /\ ((0 + y^0) <= (0 + x^0)), par{x^0 -> (0 + x^0)}>
4.98/5.07	<l2, l1, true>
4.98/5.07	<l3, l1, true>
4.98/5.07	<l4, l3, true>
4.98/5.07	
4.98/5.07	Fresh variables:
4.98/5.07	
4.98/5.07	Undef variables:
4.98/5.07	
4.98/5.07	Abstraction variables:
4.98/5.07	
4.98/5.07	Exit nodes:
4.98/5.07	
4.98/5.07	Accepting locations:
4.98/5.07	
4.98/5.07	Asserts:
4.98/5.07	
4.98/5.07	Preprocessed LLVMGraph
4.98/5.07	Init Location: 0
4.98/5.07	Transitions:
4.98/5.07	<l0, l1, true>
4.98/5.07	<l1, l1, ((0 + x^0) <= (0 + y^0)) /\ ((0 + y^0) <= (0 + x^0)), par{x^0 -> (0 + x^0)}>
4.98/5.07	
4.98/5.07	Fresh variables:
4.98/5.07	
4.98/5.07	Undef variables:
4.98/5.07	
4.98/5.07	Abstraction variables:
4.98/5.07	
4.98/5.07	Exit nodes:
4.98/5.07	
4.98/5.07	Accepting locations:
4.98/5.07	
4.98/5.07	Asserts:
4.98/5.07	
4.98/5.07	*************************************************************
4.98/5.07	*******************************************************************************************
4.98/5.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
4.98/5.07	*******************************************************************************************
4.98/5.07	
4.98/5.07	Init Location: 0
4.98/5.07	Graph 0:
4.98/5.07	Transitions:
4.98/5.07	Variables:
4.98/5.07	
4.98/5.07	Graph 1:
4.98/5.07	Transitions:
4.98/5.07	<l1, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	Variables:
4.98/5.07	x^0, y^0
4.98/5.07	
4.98/5.07	Precedence: 
4.98/5.07	Graph 0
4.98/5.07	
4.98/5.07	Graph 1
4.98/5.07	<l0, l1, true, {all remain the same}>
4.98/5.07	
4.98/5.07	Map Locations to Subgraph:
4.98/5.07	( 0 , 0 )
4.98/5.07	( 1 , 1 )
4.98/5.07	
4.98/5.07	*******************************************************************************************
4.98/5.07	********************************    CHECKING ASSERTIONS    ********************************
4.98/5.07	*******************************************************************************************
4.98/5.07	
4.98/5.07	Proving termination of subgraph 0
4.98/5.07	Proving termination of subgraph 1
4.98/5.07	Checking unfeasibility...
4.98/5.07	Time used: 0.001803
4.98/5.07	
4.98/5.07	> No variable changes in termination graph.
4.98/5.07	Checking conditional unfeasibility...
4.98/5.07	Calling Safety with literal 1 + x^0 <= y^0 and entry <l1, l1, x^0 <= y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	LOG: CALL check - Post:1 + x^0 <= y^0 - Process 1
4.98/5.07	* Exit transition: <l1, l1, x^0 <= y^0, {all remain the same}>
4.98/5.07	* Postcondition  : 1 + x^0 <= y^0
4.98/5.07	Postcodition moved up: 1 + x^0 <= y^0
4.98/5.07	
4.98/5.07	LOG: Try proving POST
4.98/5.07	Postcondition: 1 + x^0 <= y^0
4.98/5.07	
4.98/5.07	LOG: CALL check - Post:1 + x^0 <= y^0 - Process 2
4.98/5.07	* Exit transition: <l0, l1, x^0 <= y^0, {all remain the same}>
4.98/5.07	* Postcondition  : 1 + x^0 <= y^0
4.98/5.07	
4.98/5.07	LOG: CALL solveLinear
4.98/5.07	
4.98/5.07	LOG: RETURN solveLinear - Elapsed time: 0.000250s
4.98/5.07	> Postcondition is not implied!
4.98/5.07	
4.98/5.07	LOG: RETURN check - Elapsed time: 0.000333s
4.98/5.07	
4.98/5.07	LOG: NarrowEntry size 1
4.98/5.07	Narrowing transition: 
4.98/5.07	<l1, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	LOG: Narrow transition size 1
4.98/5.07	ENTRIES:
4.98/5.07	<l0, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	END ENTRIES:
4.98/5.07	GRAPH:
4.98/5.07	<l1, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	END GRAPH:
4.98/5.07	EXIT: <l1, l1, x^0 <= y^0, {all remain the same}>
4.98/5.07	POST: 1 + x^0 <= y^0
4.98/5.07	
4.98/5.07	
4.98/5.07	LOG: Try proving POST
4.98/5.07	Solving with 1 template(s).
4.98/5.07	
4.98/5.07	LOG: CALL solveNonLinearGetFirstSolution
4.98/5.07	
4.98/5.07	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005856s
4.98/5.07	Time used: 0.005756
4.98/5.07	Solving with 2 template(s).
4.98/5.07	
4.98/5.07	LOG: CALL solveNonLinearGetFirstSolution
4.98/5.07	
4.98/5.07	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000583s
4.98/5.07	Time used: 4.00029
4.98/5.07	Solving with 3 template(s).
4.98/5.07	
4.98/5.07	LOG: CALL solveNonLinearGetFirstSolution
4.98/5.07	
4.98/5.07	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002096s
4.98/5.07	Time used: 1.00021
4.98/5.07	
4.98/5.07	LOG: Postcondition is not implied - no solution
4.98/5.07	> Postcondition is not implied!
4.98/5.07	
4.98/5.07	LOG: RETURN check - Elapsed time: 5.013622s
4.98/5.07	
4.98/5.07	Proving non-termination of subgraph 1
4.98/5.07	Transitions:
4.98/5.07	<l1, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	Variables:
4.98/5.07	x^0, y^0
4.98/5.07	
4.98/5.07	Checking conditional non-termination of SCC {l1}...
4.98/5.07	EXIT TRANSITIONS:
4.98/5.07	<l1, end, 1 + y^0 <= x^0, {all remain the same}>
4.98/5.07	<l1, end, 1 + x^0 <= y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	Solving with 1 template(s).
4.98/5.07	
4.98/5.07	LOG: CALL solveNonLinearGetFirstSolution
4.98/5.07	
4.98/5.07	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005492s
4.98/5.07	Time used: 0.005337
4.98/5.07	Improving Solution with cost 2 ...
4.98/5.07	
4.98/5.07	LOG: CALL solveNonLinearGetNextSolution
4.98/5.07	
4.98/5.07	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.006326s
4.98/5.07	Time used: 0.006322
4.98/5.07	
4.98/5.07	LOG: SAT solveNonLinear - Elapsed time: 0.011817s
4.98/5.07	Cost: 2; Total time: 0.011659
4.98/5.07	Failed at location 1: x^0 <= y^0
4.98/5.07	Before Improving: 
4.98/5.07	Quasi-invariant at l1: x^0 <= y^0
4.98/5.07	Optimizing invariants...
4.98/5.07	
4.98/5.07	LOG: CALL solveLinear
4.98/5.07	
4.98/5.07	LOG: RETURN solveLinear - Elapsed time: 0.001561s
4.98/5.07	Remaining time after improvement: 0.999111
4.98/5.07	Non-termination implied by a set of quasi-invariant(s):
4.98/5.07	Quasi-invariant at l1: x^0 <= y^0
4.98/5.07	
4.98/5.07	Strengthening and disabling EXIT transitions...
4.98/5.07	Closed exits from l1: 1
4.98/5.07	Strengthening exit transition (result): 
4.98/5.07	<l1, end, 1 + x^0 <= y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	Strengthening and disabling transitions...
4.98/5.07	
4.98/5.07	LOG: CALL solverLinear in Graph for feasibility
4.98/5.07	
4.98/5.07	LOG: RETURN solveLinear in Graph for feasibility
4.98/5.07	Strengthening transition (result): 
4.98/5.07	<l1, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	Checking conditional non-termination of SCC {l1}...
4.98/5.07	EXIT TRANSITIONS:
4.98/5.07	<l1, end, 1 + x^0 <= y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	Solving with 1 template(s).
4.98/5.07	
4.98/5.07	LOG: CALL solveNonLinearGetFirstSolution
4.98/5.07	
4.98/5.07	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004210s
4.98/5.07	Time used: 0.00405
4.98/5.07	Improving Solution with cost 1 ...
4.98/5.07	
4.98/5.07	LOG: CALL solveNonLinearGetNextSolution
4.98/5.07	
4.98/5.07	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004170s
4.98/5.07	Time used: 0.004167
4.98/5.07	
4.98/5.07	LOG: SAT solveNonLinear - Elapsed time: 0.008380s
4.98/5.07	Cost: 1; Total time: 0.008217
4.98/5.07	Failed at location 1: y^0 <= x^0
4.98/5.07	Before Improving: 
4.98/5.07	Quasi-invariant at l1: y^0 <= x^0
4.98/5.07	Optimizing invariants...
4.98/5.07	
4.98/5.07	LOG: CALL solveLinear
4.98/5.07	
4.98/5.07	LOG: RETURN solveLinear - Elapsed time: 0.001372s
4.98/5.07	Remaining time after improvement: 0.999202
4.98/5.07	Non-termination implied by a set of quasi-invariant(s):
4.98/5.07	Quasi-invariant at l1: y^0 <= x^0
4.98/5.07	
4.98/5.07	Strengthening and disabling EXIT transitions...
4.98/5.07	Closed exits from l1: 1
4.98/5.07	
4.98/5.07	Strengthening and disabling transitions...
4.98/5.07	
4.98/5.07	LOG: CALL solverLinear in Graph for feasibility
4.98/5.07	
4.98/5.07	LOG: RETURN solveLinear in Graph for feasibility
4.98/5.07	Strengthening transition (result): 
4.98/5.07	<l1, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	Calling reachability with...
4.98/5.07	Transition: <l1, end, true, {all remain the same}>
4.98/5.07	Conditions: x^0 <= y^0, y^0 <= x^0, 
4.98/5.07	OPEN EXITS: 
4.98/5.07	<l1, end, true, {all remain the same}> (condsUp: x^0 <= y^0, y^0 <= x^0)
4.98/5.07	
4.98/5.07	--- Reachability graph ---
4.98/5.07	> Graph without transitions.
4.98/5.07	
4.98/5.07	Calling reachability with...
4.98/5.07	Transition: <l0, l1, true, {all remain the same}>
4.98/5.07	Conditions: x^0 <= y^0, y^0 <= x^0, 
4.98/5.07	OPEN EXITS: 
4.98/5.07	<l0, l1, x^0 = y^0, {all remain the same}>
4.98/5.07	
4.98/5.07	> Conditions are reachable!
4.98/5.07	
4.98/5.07	Program does NOT terminate
4.98/5.07	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
4.98/5.07	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
4.98/5.07	EOF