5.02/5.06	NO
5.02/5.06	
5.02/5.06	Solver Timeout: 4
5.02/5.06	Global Timeout: 300
5.02/5.06	No parsing errors!
5.02/5.06	Init Location: 0
5.02/5.06	Transitions:
5.02/5.06	<l0, l6, true>
5.02/5.06	<l1, l2, true>
5.02/5.06	<l2, l1, true>
5.02/5.06	<l3, l1, ((0 + n^0) <= 0) /\ (undef7 = 0), par{x^0 -> 1}>
5.02/5.06	<l3, l4, (1 <= (0 + n^0))>
5.02/5.06	<l4, l3, true>
5.02/5.06	<l5, l3, (undef12 = undef12), par{n^0 -> undef12, x^0 -> 1}>
5.02/5.06	<l6, l5, true>
5.02/5.06	
5.02/5.06	Fresh variables:
5.02/5.06	undef7, undef12, 
5.02/5.06	
5.02/5.06	Undef variables:
5.02/5.06	undef7, undef12, 
5.02/5.06	
5.02/5.06	Abstraction variables:
5.02/5.06	
5.02/5.06	Exit nodes:
5.02/5.06	
5.02/5.06	Accepting locations:
5.02/5.06	
5.02/5.06	Asserts:
5.02/5.06	
5.02/5.06	Preprocessed LLVMGraph
5.02/5.06	Init Location: 0
5.02/5.06	Transitions:
5.02/5.06	<l0, l3, (n^0 = undef12) /\ (undef12 = undef12)>
5.02/5.06	<l1, l1, true>
5.02/5.06	<l3, l1, ((0 + n^0) <= 0) /\ (undef7 = 0)>
5.02/5.06	<l3, l3, (1 <= (0 + n^0))>
5.02/5.06	
5.02/5.06	Fresh variables:
5.02/5.06	undef7, undef12, 
5.02/5.06	
5.02/5.06	Undef variables:
5.02/5.06	undef7, undef12, 
5.02/5.06	
5.02/5.06	Abstraction variables:
5.02/5.06	
5.02/5.06	Exit nodes:
5.02/5.06	
5.02/5.06	Accepting locations:
5.02/5.06	
5.02/5.06	Asserts:
5.02/5.06	
5.02/5.06	*************************************************************
5.02/5.06	*******************************************************************************************
5.02/5.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.02/5.06	*******************************************************************************************
5.02/5.06	
5.02/5.06	Init Location: 0
5.02/5.06	Graph 0:
5.02/5.06	Transitions:
5.02/5.06	Variables:
5.02/5.06	
5.02/5.06	Graph 1:
5.02/5.06	Transitions:
5.02/5.06	<l3, l3, 1 <= n^0, {all remain the same}>
5.02/5.06	Variables:
5.02/5.06	n^0
5.02/5.06	
5.02/5.06	Graph 2:
5.02/5.06	Transitions:
5.02/5.06	<l1, l1, true, {all remain the same}>
5.02/5.06	Variables:
5.02/5.06	
5.02/5.06	Precedence: 
5.02/5.06	Graph 0
5.02/5.06	
5.02/5.06	Graph 1
5.02/5.06	<l0, l3, n^0 = undef12, {all remain the same}>
5.02/5.06	
5.02/5.06	Graph 2
5.02/5.06	<l3, l1, n^0 <= 0 /\ undef7 = 0, {all remain the same}>
5.02/5.06	
5.02/5.06	Map Locations to Subgraph:
5.02/5.06	( 0 , 0 )
5.02/5.06	( 1 , 2 )
5.02/5.06	( 3 , 1 )
5.02/5.06	
5.02/5.06	*******************************************************************************************
5.02/5.06	********************************    CHECKING ASSERTIONS    ********************************
5.02/5.06	*******************************************************************************************
5.02/5.06	
5.02/5.06	Proving termination of subgraph 0
5.02/5.06	Proving termination of subgraph 1
5.02/5.06	Checking unfeasibility...
5.02/5.06	Time used: 0.001545
5.02/5.06	
5.02/5.06	> No variable changes in termination graph.
5.02/5.06	Checking conditional unfeasibility...
5.02/5.06	Calling Safety with literal n^0 <= 0 and entry <l3, l3, true, {all remain the same}>
5.02/5.06	
5.02/5.06	LOG: CALL check - Post:n^0 <= 0 - Process 1
5.02/5.06	* Exit transition: <l3, l3, true, {all remain the same}>
5.02/5.06	* Postcondition  : n^0 <= 0
5.02/5.06	Postcodition moved up: n^0 <= 0
5.02/5.06	
5.02/5.06	LOG: Try proving POST
5.02/5.06	Postcondition: n^0 <= 0
5.02/5.06	
5.02/5.06	LOG: CALL check - Post:n^0 <= 0 - Process 2
5.02/5.06	* Exit transition: <l0, l3, n^0 = undef12, {all remain the same}>
5.02/5.06	* Postcondition  : n^0 <= 0
5.02/5.06	
5.02/5.06	LOG: CALL solveLinear
5.02/5.06	
5.02/5.06	LOG: RETURN solveLinear - Elapsed time: 0.000288s
5.02/5.06	> Postcondition is not implied!
5.02/5.06	
5.02/5.06	LOG: RETURN check - Elapsed time: 0.000365s
5.02/5.06	
5.02/5.06	LOG: NarrowEntry size 1
5.02/5.06	Narrowing transition: 
5.02/5.06	<l3, l3, 1 <= n^0, {all remain the same}>
5.02/5.06	
5.02/5.06	LOG: Narrow transition size 1
5.02/5.06	ENTRIES:
5.02/5.06	<l0, l3, 1 <= n^0 /\ n^0 = undef12, {all remain the same}>
5.02/5.06	END ENTRIES:
5.02/5.06	GRAPH:
5.02/5.06	<l3, l3, 1 <= n^0, {all remain the same}>
5.02/5.06	END GRAPH:
5.02/5.06	EXIT: <l3, l3, true, {all remain the same}>
5.02/5.06	POST: n^0 <= 0
5.02/5.06	
5.02/5.06	
5.02/5.06	LOG: Try proving POST
5.02/5.06	Solving with 1 template(s).
5.02/5.06	
5.02/5.06	LOG: CALL solveNonLinearGetFirstSolution
5.02/5.06	
5.02/5.06	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003699s
5.02/5.06	Time used: 0.0036
5.02/5.06	Solving with 2 template(s).
5.02/5.06	
5.02/5.06	LOG: CALL solveNonLinearGetFirstSolution
5.02/5.06	
5.02/5.06	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001191s
5.02/5.06	Time used: 4.00083
5.02/5.06	Solving with 3 template(s).
5.02/5.06	
5.02/5.06	LOG: CALL solveNonLinearGetFirstSolution
5.02/5.06	
5.02/5.06	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007474s
5.02/5.06	Time used: 1.00032
5.02/5.06	
5.02/5.06	LOG: Postcondition is not implied - no solution
5.02/5.06	> Postcondition is not implied!
5.02/5.06	
5.02/5.06	LOG: RETURN check - Elapsed time: 5.017315s
5.02/5.06	
5.02/5.06	Proving non-termination of subgraph 1
5.02/5.06	Transitions:
5.02/5.06	<l3, l3, 1 <= n^0, {all remain the same}>
5.02/5.06	Variables:
5.02/5.06	n^0
5.02/5.06	
5.02/5.06	Checking conditional non-termination of SCC {l3}...
5.02/5.06	EXIT TRANSITIONS:
5.02/5.06	<l3, end, n^0 <= 0, {all remain the same}>
5.02/5.06	
5.02/5.06	Solving with 1 template(s).
5.02/5.06	
5.02/5.06	LOG: CALL solveNonLinearGetFirstSolution
5.02/5.06	
5.02/5.06	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003060s
5.02/5.06	Time used: 0.002916
5.02/5.06	Improving Solution with cost 1 ...
5.02/5.06	
5.02/5.06	LOG: CALL solveNonLinearGetNextSolution
5.02/5.06	
5.02/5.06	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.003928s
5.02/5.06	Time used: 0.003923
5.02/5.06	
5.02/5.06	LOG: SAT solveNonLinear - Elapsed time: 0.006989s
5.02/5.06	Cost: 1; Total time: 0.006839
5.02/5.06	Failed at location 3: 1 <= n^0
5.02/5.06	Before Improving: 
5.02/5.06	Quasi-invariant at l3: 1 <= n^0
5.02/5.06	Optimizing invariants...
5.02/5.06	
5.02/5.06	LOG: CALL solveLinear
5.02/5.06	
5.02/5.06	LOG: RETURN solveLinear - Elapsed time: 0.001449s
5.02/5.06	Remaining time after improvement: 0.999076
5.02/5.06	Non-termination implied by a set of quasi-invariant(s):
5.02/5.06	Quasi-invariant at l3: 1 <= n^0
5.02/5.06	
5.02/5.06	Strengthening and disabling EXIT transitions...
5.02/5.06	Closed exits from l3: 1
5.02/5.06	
5.02/5.06	Strengthening and disabling transitions...
5.02/5.06	
5.02/5.06	LOG: CALL solverLinear in Graph for feasibility
5.02/5.06	
5.02/5.06	LOG: RETURN solveLinear in Graph for feasibility
5.02/5.06	Strengthening transition (result): 
5.02/5.06	<l3, l3, 1 <= n^0, {all remain the same}>
5.02/5.06	
5.02/5.06	Calling reachability with...
5.02/5.06	Transition: <l3, end, true, {all remain the same}>
5.02/5.06	Conditions: 1 <= n^0, 
5.02/5.06	OPEN EXITS: 
5.02/5.06	<l3, end, true, {all remain the same}> (condsUp: 1 <= n^0)
5.02/5.06	
5.02/5.06	--- Reachability graph ---
5.02/5.06	> Graph without transitions.
5.02/5.06	
5.02/5.06	Calling reachability with...
5.02/5.06	Transition: <l0, l3, n^0 = undef12, {all remain the same}>
5.02/5.06	Conditions: 1 <= n^0, 
5.02/5.06	OPEN EXITS: 
5.02/5.06	<l0, l3, 1 <= n^0 /\ n^0 = undef12, {all remain the same}>
5.02/5.06	
5.02/5.06	> Conditions are reachable!
5.02/5.06	
5.02/5.06	Program does NOT terminate
5.02/5.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.02/5.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.02/5.06	EOF