5.01/5.08	NO
5.01/5.08	
5.01/5.08	Solver Timeout: 4
5.01/5.08	Global Timeout: 300
5.01/5.08	No parsing errors!
5.01/5.08	Init Location: 0
5.01/5.08	Transitions:
5.01/5.08	<l0, l10, true>
5.01/5.08	<l1, l2, ((0 + dobreak^0) <= 0) /\ (undef5 = 1) /\ (undef4 = undef4) /\ (1 <= (0 + undef4)), par{A^0 -> 0, n^0 -> undef4}>
5.01/5.08	<l1, l3, (1 <= (0 + dobreak^0))>
5.01/5.08	<l4, l1, true>
5.01/5.08	<l2, l5, true>
5.01/5.08	<l6, l7, true>
5.01/5.08	<l3, l8, true>
5.01/5.08	<l8, l3, true>
5.01/5.08	<l5, l2, (1 <= (0 + n^0))>
5.01/5.08	<l5, l4, ((0 + n^0) <= 0) /\ (undef38 = 1) /\ (undef36 = undef36), par{R^0 -> 0, dobreak^0 -> undef36}>
5.01/5.08	<l9, l4, (undef41 = undef41), par{A^0 -> 0, R^0 -> 0, dobreak^0 -> undef41}>
5.01/5.08	<l10, l9, true>
5.01/5.08	
5.01/5.08	Fresh variables:
5.01/5.08	undef4, undef5, undef36, undef38, undef41, 
5.01/5.08	
5.01/5.08	Undef variables:
5.01/5.08	undef4, undef5, undef36, undef38, undef41, 
5.01/5.08	
5.01/5.08	Abstraction variables:
5.01/5.08	
5.01/5.08	Exit nodes:
5.01/5.08	
5.01/5.08	Accepting locations:
5.01/5.08	
5.01/5.08	Asserts:
5.01/5.08	
5.01/5.08	Preprocessed LLVMGraph
5.01/5.08	Init Location: 0
5.01/5.08	Transitions:
5.01/5.08	<l0, l2, (undef41 = undef41) /\ ((0 + undef41) <= 0) /\ (undef5 = 1) /\ (undef4 = undef4) /\ (1 <= (0 + undef4)), par{n^0 -> undef4}>
5.01/5.08	<l0, l3, (undef41 = undef41) /\ (1 <= (0 + undef41))>
5.01/5.08	<l2, l2, (1 <= (0 + n^0))>
5.01/5.08	<l2, l2, ((0 + n^0) <= 0) /\ (undef38 = 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 0) /\ (undef5 = 1) /\ (undef4 = undef4) /\ (1 <= (0 + undef4)), par{n^0 -> undef4}>
5.01/5.08	<l2, l3, ((0 + n^0) <= 0) /\ (undef38 = 1) /\ (undef36 = undef36) /\ (1 <= (0 + undef36))>
5.01/5.08	<l3, l3, true>
5.01/5.08	
5.01/5.08	Fresh variables:
5.01/5.08	undef4, undef5, undef36, undef38, undef41, 
5.01/5.08	
5.01/5.08	Undef variables:
5.01/5.08	undef4, undef5, undef36, undef38, undef41, 
5.01/5.08	
5.01/5.08	Abstraction variables:
5.01/5.08	
5.01/5.08	Exit nodes:
5.01/5.08	
5.01/5.08	Accepting locations:
5.01/5.08	
5.01/5.08	Asserts:
5.01/5.08	
5.01/5.08	*************************************************************
5.01/5.08	*******************************************************************************************
5.01/5.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.01/5.08	*******************************************************************************************
5.01/5.08	
5.01/5.08	Init Location: 0
5.01/5.08	Graph 0:
5.01/5.08	Transitions:
5.01/5.08	Variables:
5.01/5.08	
5.01/5.08	Graph 1:
5.01/5.08	Transitions:
5.01/5.08	<l2, l2, 1 <= n^0, {all remain the same}>
5.01/5.08	<l2, l2, n^0 <= 0 /\ undef36 <= 0 /\ 1 <= undef4 /\ undef5 = 1 /\ undef38 = 1, {n^0 -> undef4, rest remain the same}>
5.01/5.08	Variables:
5.01/5.08	n^0
5.01/5.08	
5.01/5.08	Graph 2:
5.01/5.08	Transitions:
5.01/5.08	<l3, l3, true, {all remain the same}>
5.01/5.08	Variables:
5.01/5.08	
5.01/5.08	Precedence: 
5.01/5.08	Graph 0
5.01/5.08	
5.01/5.08	Graph 1
5.01/5.08	<l0, l2, undef41 <= 0 /\ 1 <= undef4 /\ undef5 = 1, {n^0 -> undef4, rest remain the same}>
5.01/5.08	
5.01/5.08	Graph 2
5.01/5.08	<l0, l3, 1 <= undef41, {all remain the same}>
5.01/5.08	<l2, l3, n^0 <= 0 /\ 1 <= undef36 /\ undef38 = 1, {all remain the same}>
5.01/5.08	
5.01/5.08	Map Locations to Subgraph:
5.01/5.08	( 0 , 0 )
5.01/5.08	( 2 , 1 )
5.01/5.08	( 3 , 2 )
5.01/5.08	
5.01/5.08	*******************************************************************************************
5.01/5.08	********************************    CHECKING ASSERTIONS    ********************************
5.01/5.08	*******************************************************************************************
5.01/5.08	
5.01/5.08	Proving termination of subgraph 0
5.01/5.08	Proving termination of subgraph 1
5.01/5.08	Checking unfeasibility...
5.01/5.08	Time used: 0.003196
5.01/5.08	Some transition disabled by a set of invariant(s):
5.01/5.08	Invariant at l2: 1 <= n^0
5.01/5.08	
5.01/5.08	Strengthening and disabling transitions...
5.01/5.08	> It's unfeasible. Removing transition: 
5.01/5.08	<l2, l2, n^0 <= 0 /\ undef36 <= 0 /\ 1 <= undef4 /\ undef5 = 1 /\ undef38 = 1, {n^0 -> undef4, rest remain the same}>
5.01/5.08	
5.01/5.08	LOG: CALL solverLinear in Graph for feasibility
5.01/5.08	
5.01/5.08	LOG: RETURN solveLinear in Graph for feasibility
5.01/5.08	Strengthening transition (result): 
5.01/5.08	<l2, l2, 1 <= n^0, {all remain the same}>
5.01/5.08	Checking unfeasibility...
5.01/5.08	Time used: 0.001385
5.01/5.08	
5.01/5.08	> No variable changes in termination graph.
5.01/5.08	Checking conditional unfeasibility...
5.01/5.08	Calling Safety with literal n^0 <= 0 and entry <l2, l2, true, {all remain the same}>
5.01/5.08	
5.01/5.08	LOG: CALL check - Post:n^0 <= 0 - Process 1
5.01/5.08	* Exit transition: <l2, l2, true, {all remain the same}>
5.01/5.08	* Postcondition  : n^0 <= 0
5.01/5.08	Postcodition moved up: n^0 <= 0
5.01/5.08	
5.01/5.08	LOG: Try proving POST
5.01/5.08	Postcondition: n^0 <= 0
5.01/5.08	
5.01/5.08	LOG: CALL check - Post:n^0 <= 0 - Process 2
5.01/5.08	* Exit transition: <l0, l2, undef41 <= 0 /\ 1 <= undef4 /\ undef5 = 1, {n^0 -> undef4, rest remain the same}>
5.01/5.08	* Postcondition  : n^0 <= 0
5.01/5.08	
5.01/5.08	LOG: CALL solveLinear
5.01/5.08	
5.01/5.08	LOG: RETURN solveLinear - Elapsed time: 0.000350s
5.01/5.08	> Postcondition is not implied!
5.01/5.08	
5.01/5.08	LOG: RETURN check - Elapsed time: 0.000444s
5.01/5.08	
5.01/5.08	LOG: NarrowEntry size 1
5.01/5.08	Narrowing transition: 
5.01/5.08	<l2, l2, 1 <= n^0, {all remain the same}>
5.01/5.08	
5.01/5.08	LOG: Narrow transition size 1
5.01/5.08	ENTRIES:
5.01/5.08	<l0, l2, undef41 <= 0 /\ 1 <= undef4 /\ undef5 = 1, {n^0 -> undef4, rest remain the same}>
5.01/5.08	END ENTRIES:
5.01/5.08	GRAPH:
5.01/5.08	<l2, l2, 1 <= n^0, {all remain the same}>
5.01/5.08	END GRAPH:
5.01/5.08	EXIT: <l2, l2, true, {all remain the same}>
5.01/5.08	POST: n^0 <= 0
5.01/5.08	
5.01/5.08	
5.01/5.08	LOG: Try proving POST
5.01/5.08	Solving with 1 template(s).
5.01/5.08	
5.01/5.08	LOG: CALL solveNonLinearGetFirstSolution
5.01/5.08	
5.01/5.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003976s
5.01/5.08	Time used: 0.003877
5.01/5.08	Solving with 2 template(s).
5.01/5.08	
5.01/5.08	LOG: CALL solveNonLinearGetFirstSolution
5.01/5.08	
5.01/5.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000668s
5.01/5.08	Time used: 4.00041
5.01/5.08	Solving with 3 template(s).
5.01/5.08	
5.01/5.08	LOG: CALL solveNonLinearGetFirstSolution
5.01/5.08	
5.01/5.08	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020920s
5.01/5.08	Time used: 1.00035
5.01/5.08	
5.01/5.08	LOG: Postcondition is not implied - no solution
5.01/5.08	> Postcondition is not implied!
5.01/5.08	
5.01/5.08	LOG: RETURN check - Elapsed time: 5.031431s
5.01/5.08	
5.01/5.08	Proving non-termination of subgraph 1
5.01/5.08	Transitions:
5.01/5.08	<l2, l2, 1 <= n^0, {all remain the same}>
5.01/5.08	Variables:
5.01/5.08	n^0
5.01/5.08	
5.01/5.08	Checking conditional non-termination of SCC {l2}...
5.01/5.08	> No exit transition to close.
5.01/5.08	Calling reachability with...
5.01/5.08	Transition: <l2, end, true, {all remain the same}>
5.01/5.08	Conditions: 
5.01/5.08	OPEN EXITS: 
5.01/5.08	<l2, end, true, {all remain the same}>
5.01/5.08	
5.01/5.08	--- Reachability graph ---
5.01/5.08	> Graph without transitions.
5.01/5.08	
5.01/5.08	Calling reachability with...
5.01/5.08	Transition: <l0, l2, undef41 <= 0 /\ 1 <= undef4 /\ undef5 = 1, {n^0 -> undef4, rest remain the same}>
5.01/5.08	Conditions: 
5.01/5.08	OPEN EXITS: 
5.01/5.08	<l0, l2, undef41 <= 0 /\ 1 <= undef4 /\ undef5 = 1, {n^0 -> undef4, rest remain the same}>
5.01/5.08	
5.01/5.08	> Conditions are reachable!
5.01/5.08	
5.01/5.08	Program does NOT terminate
5.01/5.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.01/5.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.01/5.09	EOF