0.00/0.13	YES
0.00/0.13	
0.00/0.13	Solver Timeout: 4
0.00/0.13	Global Timeout: 300
0.00/0.13	No parsing errors!
0.00/0.13	Init Location: 0
0.00/0.13	Transitions:
0.00/0.13	<l0, l4, true>
0.00/0.13	<l1, l2, (arg2 > ~(1)) /\ (undef6 <= (200 * arg2)) /\ (arg1 > 0), par{arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}>
0.00/0.13	<l2, l3, (arg2 > ~(1)) /\ (undef8 <= (200 * arg2)) /\ (arg1 > 0) /\ (((200 * arg2) - (13 * undef8)) < 13) /\ (((200 * arg2) - (13 * undef8)) >= 0), par{arg1 -> (100 * arg2), arg2 -> undef8, arg3 -> ((100 * arg2) + undef8), arg4 -> arg2, arg5 -> 0}>
0.00/0.13	<l3, l3, (arg3 > 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}>
0.00/0.13	<l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ ((undef22 * undef23) <= 9) /\ ((arg5 + 2) <= arg4) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1)), arg5 -> (arg5 + 2)}>
0.00/0.13	<l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef29 > ~(1)) /\ (undef30 > ~(1)) /\ ((undef29 * undef30) > 9) /\ ((arg5 + 2) <= arg4) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2), arg5 -> (arg5 + 2)}>
0.00/0.13	<l4, l1, true, par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, arg5 -> undef35}>
0.00/0.13	
0.00/0.13	Fresh variables:
0.00/0.13	undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 
0.00/0.13	
0.00/0.13	Undef variables:
0.00/0.13	undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 
0.00/0.13	
0.00/0.13	Abstraction variables:
0.00/0.13	
0.00/0.13	Exit nodes:
0.00/0.13	
0.00/0.13	Accepting locations:
0.00/0.13	
0.00/0.13	Asserts:
0.00/0.13	
0.00/0.13	Preprocessed LLVMGraph
0.00/0.13	Init Location: 0
0.00/0.13	Transitions:
0.00/0.13	<l0, l3, (arg1 = (100 * undef32)) /\ (arg2 = undef8) /\ (arg3 = ((100 * undef32) + undef8)) /\ (arg4 = undef32) /\ (arg5 = 0) /\ (undef32 > ~(1)) /\ (undef6 <= (200 * undef32)) /\ (undef31 > 0) /\ (undef32 > ~(1)) /\ (undef8 <= (200 * undef32)) /\ (undef31 > 0) /\ (((200 * undef32) - (13 * undef8)) < 13) /\ (((200 * undef32) - (13 * undef8)) >= 0)>
0.00/0.13	<l3, l3, (arg3 > 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}>
0.00/0.13	<l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ ((arg5 + 2) <= arg4) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1)), arg5 -> (arg5 + 2)}>
0.00/0.13	<l3, l3, (arg4 > 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef29 > ~(1)) /\ (undef30 > ~(1)) /\ ((arg5 + 2) <= arg4) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2), arg5 -> (arg5 + 2)}>
0.00/0.13	
0.00/0.13	Fresh variables:
0.00/0.13	undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 
0.00/0.13	
0.00/0.13	Undef variables:
0.00/0.13	undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 
0.00/0.13	
0.00/0.13	Abstraction variables:
0.00/0.13	
0.00/0.13	Exit nodes:
0.00/0.13	
0.00/0.13	Accepting locations:
0.00/0.13	
0.00/0.13	Asserts:
0.00/0.13	
0.00/0.13	*************************************************************
0.00/0.13	*******************************************************************************************
0.00/0.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.13	*******************************************************************************************
0.00/0.13	
0.00/0.13	Init Location: 0
0.00/0.13	Graph 0:
0.00/0.13	Transitions:
0.00/0.13	Variables:
0.00/0.13	
0.00/0.13	Graph 1:
0.00/0.13	Transitions:
0.00/0.13	<l3, l3, 1 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg3 /\ 0 <= arg5 /\ 0 <= undef22 /\ 0 <= undef23 /\ 2 <= arg4 /\ 2 + arg5 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg3 /\ 0 <= arg5 /\ 0 <= undef29 /\ 0 <= undef30 /\ 2 <= arg4 /\ 2 + arg5 <= arg4, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4, arg5
0.00/0.13	
0.00/0.13	Precedence: 
0.00/0.13	Graph 0
0.00/0.13	
0.00/0.13	Graph 1
0.00/0.13	<l0, l3, 1 <= undef31 /\ undef6 <= 200*undef32 /\ undef8 <= 200*undef32 /\ 13*undef8 <= 200*undef32 /\ 0 <= undef32 /\ 200*undef32 <= 12 + 13*undef8 /\ arg1 = 100*undef32 /\ arg2 = undef8 /\ arg3 = undef8 + 100*undef32 /\ arg4 = undef32 /\ arg5 = 0, {all remain the same}>
0.00/0.13	
0.00/0.13	Map Locations to Subgraph:
0.00/0.13	( 0 , 0 )
0.00/0.13	( 3 , 1 )
0.00/0.13	
0.00/0.13	*******************************************************************************************
0.00/0.13	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.13	*******************************************************************************************
0.00/0.13	
0.00/0.13	Detected abstraction incompatible with non-termination check.
0.00/0.13	Proving termination of subgraph 0
0.00/0.13	Proving termination of subgraph 1
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.035418
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l3}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.003418s
0.00/0.13	Ranking function: arg4 - arg5
0.00/0.13	New Graphs: 
0.00/0.13	Transitions:
0.00/0.13	<l3, l3, 1 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4, arg5
0.00/0.13	Checking conditional termination of SCC {l3}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.000684s
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.002720s
0.00/0.13	Trying to remove transition: <l3, l3, 1 <= arg3 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009706s
0.00/0.13	Time used: 0.00949
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038349s
0.00/0.13	Time used: 0.037744
0.00/0.13	
0.00/0.13	LOG: SAT solveNonLinear - Elapsed time: 0.038349s
0.00/0.13	Cost: 0; Total time: 0.037744
0.00/0.13	Termination implied by a set of invariant(s):
0.00/0.13	Invariant at l3: arg3 <= arg1 + arg2 + arg5
0.00/0.13	[ Invariant Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l3, l3, 1 <= arg3 /\ arg3 <= arg1 + arg2 + arg5 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l3, l3, 1 <= arg3 /\ arg3 <= arg1 + arg2 + arg5 /\ 0 <= arg5 /\ 0 <= undef22 /\ 0 <= undef23 /\ 2 <= arg4 /\ 2 + arg5 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l3, l3, 1 <= arg3 /\ arg3 <= arg1 + arg2 + arg5 /\ 0 <= arg5 /\ 0 <= undef29 /\ 0 <= undef30 /\ 2 <= arg4 /\ 2 + arg5 <= arg4, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}>
0.00/0.13	[ Termination Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l3, l3, 1 <= arg3 /\ arg3 <= arg1 + arg2 + arg5 /\ arg4 <= arg5 /\ 0 <= arg4, {arg2 -> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}>
0.00/0.13	Ranking function: arg1 + arg2 + arg5
0.00/0.13	New Graphs: 
0.00/0.13	INVARIANTS: 
0.00/0.13	3: arg3 <= arg1 + arg2 + arg5 , 
0.00/0.13	Quasi-INVARIANTS to narrow Graph: 
0.00/0.13	3: 
0.00/0.13	Program Terminates
0.00/0.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.13	EOF