0.98/0.99	NO
0.98/0.99	
0.98/0.99	Solver Timeout: 4
0.98/0.99	Global Timeout: 300
0.98/0.99	No parsing errors!
0.98/0.99	Init Location: 0
0.98/0.99	Transitions:
0.98/0.99	<l0, l5, true>
0.98/0.99	<l1, l2, true, par{x_1^0 -> 2}>
0.98/0.99	<l3, l2, ((0 + y_1^0) <= 0), par{x_1^0 -> (~(1) + x_1^0)}>
0.98/0.99	<l3, l2, (1 <= (0 + y_1^0)), par{x_1^0 -> (1 + x_1^0)}>
0.98/0.99	<l2, l3, (undef8 = undef8), par{y_1^0 -> undef8}>
0.98/0.99	<l2, l4, (2 <= 0)>
0.98/0.99	<l5, l1, true>
0.98/0.99	
0.98/0.99	Fresh variables:
0.98/0.99	undef8, 
0.98/0.99	
0.98/0.99	Undef variables:
0.98/0.99	undef8, 
0.98/0.99	
0.98/0.99	Abstraction variables:
0.98/0.99	
0.98/0.99	Exit nodes:
0.98/0.99	
0.98/0.99	Accepting locations:
0.98/0.99	
0.98/0.99	Asserts:
0.98/0.99	
0.98/0.99	Preprocessed LLVMGraph
0.98/0.99	Init Location: 0
0.98/0.99	Transitions:
0.98/0.99	<l0, l2, (x_1^0 = 2)>
0.98/0.99	<l2, l2, (undef8 = undef8) /\ ((0 + undef8) <= 0), par{x_1^0 -> (~(1) + x_1^0)}>
0.98/0.99	<l2, l2, (undef8 = undef8) /\ (1 <= (0 + undef8)), par{x_1^0 -> (1 + x_1^0)}>
0.98/0.99	
0.98/0.99	Fresh variables:
0.98/0.99	undef8, 
0.98/0.99	
0.98/0.99	Undef variables:
0.98/0.99	undef8, 
0.98/0.99	
0.98/0.99	Abstraction variables:
0.98/0.99	
0.98/0.99	Exit nodes:
0.98/0.99	
0.98/0.99	Accepting locations:
0.98/0.99	
0.98/0.99	Asserts:
0.98/0.99	
0.98/0.99	*************************************************************
0.98/0.99	*******************************************************************************************
0.98/0.99	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.98/0.99	*******************************************************************************************
0.98/0.99	
0.98/0.99	Init Location: 0
0.98/0.99	Graph 0:
0.98/0.99	Transitions:
0.98/0.99	Variables:
0.98/0.99	
0.98/0.99	Graph 1:
0.98/0.99	Transitions:
0.98/0.99	<l2, l2, undef8 <= 0, {x_1^0 -> -1 + x_1^0, rest remain the same}>
0.98/0.99	<l2, l2, 1 <= undef8, {x_1^0 -> 1 + x_1^0, rest remain the same}>
0.98/0.99	Variables:
0.98/0.99	x_1^0
0.98/0.99	
0.98/0.99	Precedence: 
0.98/0.99	Graph 0
0.98/0.99	
0.98/0.99	Graph 1
0.98/0.99	<l0, l2, x_1^0 = 2, {all remain the same}>
0.98/0.99	
0.98/0.99	Map Locations to Subgraph:
0.98/0.99	( 0 , 0 )
0.98/0.99	( 2 , 1 )
0.98/0.99	
0.98/0.99	*******************************************************************************************
0.98/0.99	********************************    CHECKING ASSERTIONS    ********************************
0.98/0.99	*******************************************************************************************
0.98/0.99	
0.98/0.99	Proving termination of subgraph 0
0.98/0.99	Proving termination of subgraph 1
0.98/0.99	Checking unfeasibility...
0.98/0.99	Time used: 0.002848
0.98/0.99	
0.98/0.99	Checking conditional termination of SCC {l2}...
0.98/0.99	
0.98/0.99	LOG: CALL solveLinear
0.98/0.99	
0.98/0.99	LOG: RETURN solveLinear - Elapsed time: 0.001043s
0.98/0.99	
0.98/0.99	LOG: CALL solveLinear
0.98/0.99	
0.98/0.99	LOG: RETURN solveLinear - Elapsed time: 0.002182s
0.98/0.99	Trying to remove transition: <l2, l2, 1 <= undef8, {x_1^0 -> 1 + x_1^0, rest remain the same}>
0.98/0.99	Solving with 1 template(s).
0.98/0.99	
0.98/0.99	LOG: CALL solveNonLinearGetFirstSolution
0.98/0.99	
0.98/0.99	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004766s
0.98/0.99	Time used: 0.004633
0.98/0.99	Trying to remove transition: <l2, l2, undef8 <= 0, {x_1^0 -> -1 + x_1^0, rest remain the same}>
0.98/0.99	Solving with 1 template(s).
0.98/0.99	
0.98/0.99	LOG: CALL solveNonLinearGetFirstSolution
0.98/0.99	
0.98/0.99	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004404s
0.98/0.99	Time used: 0.00414
0.98/0.99	Solving with 1 template(s).
0.98/0.99	
0.98/0.99	LOG: CALL solveNonLinearGetFirstSolution
0.98/0.99	
0.98/0.99	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012029s
0.98/0.99	Time used: 0.011756
0.98/0.99	Solving with 2 template(s).
0.98/0.99	
0.98/0.99	LOG: CALL solveNonLinearGetFirstSolution
0.98/0.99	
0.98/0.99	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.188379s
0.98/0.99	Time used: 0.187776
0.98/0.99	Solving with 3 template(s).
0.98/0.99	
0.98/0.99	LOG: CALL solveNonLinearGetFirstSolution
0.98/0.99	
0.98/0.99	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.722388s
0.98/0.99	Time used: 0.719903
0.98/0.99	Solving with 1 template(s).
0.98/0.99	
0.98/0.99	LOG: CALL solveNonLinearGetFirstSolution
0.98/0.99	
0.98/0.99	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015705s
0.98/0.99	Time used: 0.010656
0.98/0.99	Termination failed. Trying to show unreachability...
0.98/0.99	Proving unreachability of entry: <l0, l2, x_1^0 = 2, {all remain the same}>
0.98/0.99	
0.98/0.99	LOG: CALL check - Post:1 <= 0 - Process 1
0.98/0.99	* Exit transition: <l0, l2, x_1^0 = 2, {all remain the same}>
0.98/0.99	* Postcondition  : 1 <= 0
0.98/0.99	
0.98/0.99	LOG: CALL solveLinear
0.98/0.99	
0.98/0.99	LOG: RETURN solveLinear - Elapsed time: 0.000787s
0.98/0.99	> Postcondition is not implied!
0.98/0.99	
0.98/0.99	LOG: RETURN check - Elapsed time: 0.000873s
0.98/0.99	Cannot prove unreachability
0.98/0.99	
0.98/0.99	Proving non-termination of subgraph 1
0.98/0.99	Transitions:
0.98/0.99	<l2, l2, undef8 <= 0, {x_1^0 -> -1 + x_1^0, rest remain the same}>
0.98/0.99	<l2, l2, 1 <= undef8, {x_1^0 -> 1 + x_1^0, rest remain the same}>
0.98/0.99	Variables:
0.98/0.99	x_1^0
0.98/0.99	
0.98/0.99	Checking conditional non-termination of SCC {l2}...
0.98/0.99	> No exit transition to close.
0.98/0.99	Calling reachability with...
0.98/0.99	Transition: <l2, end, true, {all remain the same}>
0.98/0.99	Conditions: 
0.98/0.99	OPEN EXITS: 
0.98/0.99	<l2, end, true, {all remain the same}>
0.98/0.99	
0.98/0.99	--- Reachability graph ---
0.98/0.99	> Graph without transitions.
0.98/0.99	
0.98/0.99	Calling reachability with...
0.98/0.99	Transition: <l0, l2, x_1^0 = 2, {all remain the same}>
0.98/0.99	Conditions: 
0.98/0.99	OPEN EXITS: 
0.98/0.99	<l0, l2, x_1^0 = 2, {all remain the same}>
0.98/0.99	
0.98/0.99	> Conditions are reachable!
0.98/0.99	
0.98/0.99	Program does NOT terminate
0.98/0.99	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.98/0.99	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.98/0.99	EOF