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, l7, true>
4.98/5.07	<l1, l2, (undef9 = undef9) /\ (undef8 = undef8), par{x_5^0 -> undef8, y_6^0 -> undef9}>
4.98/5.07	<l2, l3, (undef19 = (0 + cnt_15^0)) /\ (undef20 = (0 + cnt_20^0)) /\ ((0 + undef19) <= (0 + undef20)) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ (undef10 = undef10), par{Result_4^0 -> undef10, lt_8^0 -> undef15, lt_9^0 -> undef16}>
4.98/5.07	<l2, l4, true, par{lt_8^0 -> (0 + cnt_15^0), lt_9^0 -> (0 + cnt_20^0)}>
4.98/5.07	<l4, l5, (undef31 = __disjvr_0^0) /\ (__disjvr_0^0 = undef31), par{__disjvr_0^0 -> undef31}>
4.98/5.07	<l5, l6, (undef44 = undef44) /\ (undef45 = undef45) /\ (undef48 = (0 + cnt_15^0)) /\ (undef43 = undef43), par{lt_7^0 -> undef43, lt_8^0 -> undef44, lt_9^0 -> undef45}>
4.98/5.07	<l6, l2, true>
4.98/5.07	<l7, l1, true>
4.98/5.07	
4.98/5.07	Fresh variables:
4.98/5.07	undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 
4.98/5.07	
4.98/5.07	Undef variables:
4.98/5.07	undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 
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, l2, (undef9 = undef9) /\ (undef8 = undef8)>
4.98/5.07	<l2, l3, (undef19 = (0 + cnt_15^0)) /\ (undef20 = (0 + cnt_20^0)) /\ ((0 + undef19) <= (0 + undef20)) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ (undef10 = undef10)>
4.98/5.07	<l2, l2, (undef31 = __disjvr_0^0) /\ (__disjvr_0^0 = undef31) /\ (undef44 = undef44) /\ (undef45 = undef45) /\ (undef48 = (0 + cnt_15^0)) /\ (undef43 = undef43), par{__disjvr_0^0 -> undef31}>
4.98/5.07	
4.98/5.07	Fresh variables:
4.98/5.07	undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 
4.98/5.07	
4.98/5.07	Undef variables:
4.98/5.07	undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 
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	<l2, l2, __disjvr_0^0 = undef31 /\ cnt_15^0 = undef48, {__disjvr_0^0 -> undef31, rest remain the same}>
4.98/5.07	Variables:
4.98/5.07	__disjvr_0^0, cnt_15^0
4.98/5.07	
4.98/5.07	Graph 2:
4.98/5.07	Transitions:
4.98/5.07	Variables:
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, l2, true, {all remain the same}>
4.98/5.07	
4.98/5.07	Graph 2
4.98/5.07	<l2, l3, cnt_15^0 = undef19 /\ cnt_20^0 = undef20 /\ undef19 = undef20, {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	( 2 , 1 )
4.98/5.07	( 3 , 2 )
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.001857
4.98/5.07	
4.98/5.07	Checking conditional termination of SCC {l2}...
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.000526s
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.001678s
4.98/5.07	Trying to remove transition: <l2, l2, __disjvr_0^0 = undef31 /\ cnt_15^0 = undef48, {__disjvr_0^0 -> undef31, rest remain the same}>
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.004285s
4.98/5.07	Time used: 0.004131
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.006408s
4.98/5.07	Time used: 0.006139
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.000659s
4.98/5.07	Time used: 4.00043
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.004566s
4.98/5.07	Time used: 1.00043
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.007404s
4.98/5.07	Time used: 0.00447
4.98/5.07	Termination failed. Trying to show unreachability...
4.98/5.07	Proving unreachability of entry: <l0, l2, true, {all remain the same}>
4.98/5.07	
4.98/5.07	LOG: CALL check - Post:1 <= 0 - Process 1
4.98/5.07	* Exit transition: <l0, l2, true, {all remain the same}>
4.98/5.07	* Postcondition  : 1 <= 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.000635s
4.98/5.07	> Postcondition is not implied!
4.98/5.07	
4.98/5.07	LOG: RETURN check - Elapsed time: 0.000701s
4.98/5.07	Cannot prove unreachability
4.98/5.07	
4.98/5.07	Proving non-termination of subgraph 1
4.98/5.07	Transitions:
4.98/5.07	<l2, l2, __disjvr_0^0 = undef31 /\ cnt_15^0 = undef48, {__disjvr_0^0 -> undef31, rest remain the same}>
4.98/5.07	Variables:
4.98/5.07	__disjvr_0^0, cnt_15^0
4.98/5.07	
4.98/5.07	Checking conditional non-termination of SCC {l2}...
4.98/5.07	> No exit transition to close.
4.98/5.07	Checking that every undef value has an assignment...
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.001646s
4.98/5.07	Calling reachability with...
4.98/5.07	Transition: <l2, end, true, {all remain the same}>
4.98/5.07	Conditions: 
4.98/5.07	OPEN EXITS: 
4.98/5.07	<l2, end, true, {all remain the same}>
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, l2, true, {all remain the same}>
4.98/5.07	Conditions: 
4.98/5.07	OPEN EXITS: 
4.98/5.07	<l0, l2, true, {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/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
4.98/5.07	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
4.98/5.07	EOF