5.11/5.14	NO
5.11/5.14	
5.11/5.14	Solver Timeout: 4
5.11/5.14	Global Timeout: 300
5.11/5.14	No parsing errors!
5.11/5.14	Init Location: 0
5.11/5.14	Transitions:
5.11/5.14	<l0, l10, true>
5.11/5.14	<l1, l2, true>
5.11/5.14	<l3, l4, true>
5.11/5.14	<l5, l6, true>
5.11/5.14	<l7, l8, true>
5.11/5.14	<l8, l7, true>
5.11/5.14	<l4, l3, (1 <= (0 + n^0))>
5.11/5.14	<l4, l1, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33), par{R^0 -> 0, ___rho_1_^0 -> undef33, dobreak^0 -> (0 + undef33)}>
5.11/5.14	<l2, l3, ((0 + dobreak^0) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{A^0 -> 0, ___rho_1_^0 -> undef39, n^0 -> (0 + undef39)}>
5.11/5.14	<l2, l7, (1 <= (0 + dobreak^0))>
5.11/5.14	<l9, l1, (undef50 = undef50), par{A^0 -> 0, R^0 -> 0, ___rho_1_^0 -> undef50, dobreak^0 -> (0 + undef50)}>
5.11/5.14	<l10, l9, true>
5.11/5.14	
5.11/5.14	Fresh variables:
5.11/5.14	undef33, undef36, undef39, undef42, undef50, 
5.11/5.14	
5.11/5.14	Undef variables:
5.11/5.14	undef33, undef36, undef39, undef42, undef50, 
5.11/5.14	
5.11/5.14	Abstraction variables:
5.11/5.14	
5.11/5.14	Exit nodes:
5.11/5.14	
5.11/5.14	Accepting locations:
5.11/5.14	
5.11/5.14	Asserts:
5.11/5.14	
5.11/5.14	Preprocessed LLVMGraph
5.11/5.14	Init Location: 0
5.11/5.14	Transitions:
5.11/5.14	<l0, l3, (undef50 = undef50) /\ ((0 + (0 + undef50)) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{n^0 -> (0 + undef39)}>
5.11/5.14	<l0, l7, (undef50 = undef50) /\ (1 <= (0 + (0 + undef50)))>
5.11/5.14	<l3, l3, (1 <= (0 + n^0))>
5.11/5.14	<l3, l3, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ ((0 + (0 + undef33)) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{n^0 -> (0 + undef39)}>
5.11/5.14	<l3, l7, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ (1 <= (0 + (0 + undef33)))>
5.11/5.14	<l7, l7, true>
5.11/5.14	
5.11/5.14	Fresh variables:
5.11/5.14	undef33, undef36, undef39, undef42, undef50, 
5.11/5.14	
5.11/5.14	Undef variables:
5.11/5.14	undef33, undef36, undef39, undef42, undef50, 
5.11/5.14	
5.11/5.14	Abstraction variables:
5.11/5.14	
5.11/5.14	Exit nodes:
5.11/5.14	
5.11/5.14	Accepting locations:
5.11/5.14	
5.11/5.14	Asserts:
5.11/5.14	
5.11/5.14	*************************************************************
5.11/5.14	*******************************************************************************************
5.11/5.14	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.11/5.14	*******************************************************************************************
5.11/5.14	
5.11/5.14	Init Location: 0
5.11/5.14	Graph 0:
5.11/5.14	Transitions:
5.11/5.14	Variables:
5.11/5.14	
5.11/5.14	Graph 1:
5.11/5.14	Transitions:
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	Variables:
5.11/5.14	n^0
5.11/5.14	
5.11/5.14	Graph 2:
5.11/5.14	Transitions:
5.11/5.14	<l7, l7, true, {all remain the same}>
5.11/5.14	Variables:
5.11/5.14	
5.11/5.14	Precedence: 
5.11/5.14	Graph 0
5.11/5.14	
5.11/5.14	Graph 1
5.11/5.14	<l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	
5.11/5.14	Graph 2
5.11/5.14	<l0, l7, 1 <= undef50, {all remain the same}>
5.11/5.14	<l3, l7, 1 <= undef33 /\ n^0 <= 0 /\ undef36 = 1, {all remain the same}>
5.11/5.14	
5.11/5.14	Map Locations to Subgraph:
5.11/5.14	( 0 , 0 )
5.11/5.14	( 3 , 1 )
5.11/5.14	( 7 , 2 )
5.11/5.14	
5.11/5.14	*******************************************************************************************
5.11/5.14	********************************    CHECKING ASSERTIONS    ********************************
5.11/5.14	*******************************************************************************************
5.11/5.14	
5.11/5.14	Proving termination of subgraph 0
5.11/5.14	Proving termination of subgraph 1
5.11/5.14	Checking unfeasibility...
5.11/5.14	Time used: 0.002657
5.11/5.14	
5.11/5.14	Checking conditional termination of SCC {l3}...
5.11/5.14	
5.11/5.14	LOG: CALL solveLinear
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear - Elapsed time: 0.000636s
5.11/5.14	
5.11/5.14	LOG: CALL solveLinear
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear - Elapsed time: 0.001946s
5.11/5.14	Trying to remove transition: <l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	Solving with 1 template(s).
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004226s
5.11/5.14	Time used: 0.004073
5.11/5.14	Solving with 1 template(s).
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007348s
5.11/5.14	Time used: 0.006964
5.11/5.14	Improving Solution with cost 1 ...
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetNextSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017155s
5.11/5.14	Time used: 0.017151
5.11/5.14	
5.11/5.14	LOG: SAT solveNonLinear - Elapsed time: 0.024503s
5.11/5.14	Cost: 1; Total time: 0.024115
5.11/5.14	Failed at location 3: 1 <= n^0
5.11/5.14	Before Improving: 
5.11/5.14	Quasi-invariant at l3: 1 <= n^0
5.11/5.14	Optimizing invariants...
5.11/5.14	
5.11/5.14	LOG: CALL solveLinear
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear - Elapsed time: 0.003094s
5.11/5.14	Remaining time after improvement: 0.998555
5.11/5.14	Termination implied by a set of quasi-invariant(s):
5.11/5.14	Quasi-invariant at l3: 1 <= n^0
5.11/5.14	[ Invariant Graph ]
5.11/5.14	Strengthening and disabling transitions...
5.11/5.14	
5.11/5.14	LOG: CALL solverLinear in Graph for feasibility
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear in Graph for feasibility
5.11/5.14	Strengthening transition (result): 
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	
5.11/5.14	LOG: CALL solverLinear in Graph for feasibility
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear in Graph for feasibility
5.11/5.14	It's unfeasible. Removing transition: 
5.11/5.14	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	[ Termination Graph ]
5.11/5.14	Strengthening and disabling transitions...
5.11/5.14	
5.11/5.14	LOG: CALL solverLinear in Graph for feasibility
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear in Graph for feasibility
5.11/5.14	Strengthening transition (result): 
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	
5.11/5.14	LOG: CALL solverLinear in Graph for feasibility
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear in Graph for feasibility
5.11/5.14	It's unfeasible. Removing transition: 
5.11/5.14	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	New Graphs: 
5.11/5.14	Transitions:
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	Variables:
5.11/5.14	n^0
5.11/5.14	> No variable changes in termination graph.
5.11/5.14	Checking conditional unfeasibility...
5.11/5.14	Calling Safety with literal n^0 <= 0 and entry <l3, l3, true, {all remain the same}>
5.11/5.14	
5.11/5.14	LOG: CALL check - Post:n^0 <= 0 - Process 1
5.11/5.14	* Exit transition: <l3, l3, true, {all remain the same}>
5.11/5.14	* Postcondition  : n^0 <= 0
5.11/5.14	Quasi-invariants: 
5.11/5.14	Location 3: n^0 <= 0 ; undef39 <= 0 ; 
5.11/5.14	Postcondition: n^0 <= 0
5.11/5.14	
5.11/5.14	LOG: CALL check - Post:n^0 <= 0 - Process 2
5.11/5.14	* Exit transition: <l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	* Postcondition  : n^0 <= 0
5.11/5.14	
5.11/5.14	LOG: CALL solveLinear
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear - Elapsed time: 0.000361s
5.11/5.14	> Postcondition is not implied!
5.11/5.14	
5.11/5.14	LOG: RETURN check - Elapsed time: 0.000445s
5.11/5.14	Postcondition: undef39 <= 0
5.11/5.14	
5.11/5.14	LOG: CALL check - Post:undef39 <= 0 - Process 3
5.11/5.14	* Exit transition: <l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	* Postcondition  : undef39 <= 0
5.11/5.14	
5.11/5.14	LOG: CALL solveLinear
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear - Elapsed time: 0.000361s
5.11/5.14	> Postcondition is not implied!
5.11/5.14	
5.11/5.14	LOG: RETURN check - Elapsed time: 0.000440s
5.11/5.14	
5.11/5.14	LOG: NarrowEntry size 2
5.11/5.14	Narrowing transition: 
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	
5.11/5.14	LOG: Narrow transition size 2
5.11/5.14	Narrowing transition: 
5.11/5.14	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	
5.11/5.14	LOG: Narrow transition size 2
5.11/5.14	ENTRIES:
5.11/5.14	<l0, l3, 1 <= undef39 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	END ENTRIES:
5.11/5.14	GRAPH:
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	<l3, l3, 1 <= undef39 /\ n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	END GRAPH:
5.11/5.14	EXIT: <l3, l3, true, {all remain the same}>
5.11/5.14	POST: n^0 <= 0
5.11/5.14	
5.11/5.14	
5.11/5.14	LOG: Try proving POST
5.11/5.14	Solving with 1 template(s).
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004150s
5.11/5.14	Time used: 0.003971
5.11/5.14	Improving Solution with cost 50 ...
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetNextSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008430s
5.11/5.14	Time used: 0.008426
5.11/5.14	
5.11/5.14	LOG: SAT solveNonLinear - Elapsed time: 0.012580s
5.11/5.14	Cost: 50; Total time: 0.012397
5.11/5.14	Some transition disabled by a set of invariant(s):
5.11/5.14	Invariant at l3: 1 <= n^0
5.11/5.14	Strengthening and disabling transitions...
5.11/5.14	> It's unfeasible. Removing transition: 
5.11/5.14	<l3, l3, 1 <= undef39 /\ n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	
5.11/5.14	LOG: CALL solverLinear in Graph for feasibility
5.11/5.14	
5.11/5.14	LOG: RETURN solveLinear in Graph for feasibility
5.11/5.14	Strengthening transition (result): 
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	Solving with 1 template(s).
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003979s
5.11/5.14	Time used: 0.003881
5.11/5.14	Solving with 2 template(s).
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001145s
5.11/5.14	Time used: 4.0009
5.11/5.14	Solving with 3 template(s).
5.11/5.14	
5.11/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.14	
5.11/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021257s
5.11/5.14	Time used: 1.00041
5.11/5.14	
5.11/5.14	LOG: Postcondition is not implied - no solution
5.11/5.14	> Postcondition is not implied!
5.11/5.14	
5.11/5.14	LOG: RETURN check - Elapsed time: 5.049046s
5.11/5.14	
5.11/5.14	Proving non-termination of subgraph 1
5.11/5.14	Transitions:
5.11/5.14	<l3, l3, 1 <= n^0, {all remain the same}>
5.11/5.14	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	Variables:
5.11/5.14	n^0
5.11/5.14	
5.11/5.14	Checking conditional non-termination of SCC {l3}...
5.11/5.14	> No exit transition to close.
5.11/5.14	Calling reachability with...
5.11/5.14	Transition: <l3, end, true, {all remain the same}>
5.11/5.14	Conditions: 
5.11/5.14	OPEN EXITS: 
5.11/5.14	<l3, end, true, {all remain the same}>
5.11/5.14	
5.11/5.14	--- Reachability graph ---
5.11/5.14	> Graph without transitions.
5.11/5.14	
5.11/5.14	Calling reachability with...
5.11/5.14	Transition: <l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	Conditions: 
5.11/5.14	OPEN EXITS: 
5.11/5.14	<l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.11/5.14	
5.11/5.14	> Conditions are reachable!
5.11/5.14	
5.11/5.14	Program does NOT terminate
5.11/5.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.11/5.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.11/5.14	EOF