0.00/0.09	YES
0.00/0.09	
0.00/0.09	Solver Timeout: 4
0.00/0.09	Global Timeout: 300
0.00/0.09	No parsing errors!
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l4, true>
0.00/0.09	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg2 - 1), arg3 -> 0}>
0.00/0.09	<l2, l2, (arg2 > 0) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef6}>
0.00/0.09	<l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1}>
0.00/0.09	<l2, l3, (arg2 < 1) /\ (undef10 > 0), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}>
0.00/0.09	<l3, l3, ((undef13 + 1) <= arg1) /\ (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}>
0.00/0.09	<l4, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	Preprocessed LLVMGraph
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l2, (arg1 = (undef17 - 1)) /\ (arg2 = undef17) /\ (arg3 = 0) /\ (undef16 > 0) /\ (undef17 > ~(1))>
0.00/0.09	<l2, l2, (arg2 > 0) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef6}>
0.00/0.09	<l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1}>
0.00/0.09	<l2, l3, (arg2 < 1) /\ (undef10 > 0), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}>
0.00/0.09	<l3, l3, ((undef13 + 1) <= arg1) /\ (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef6, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	*************************************************************
0.00/0.09	*******************************************************************************************
0.00/0.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Init Location: 0
0.00/0.09	Graph 0:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Graph 1:
0.00/0.09	Transitions:
0.00/0.09	<l2, l2, 1 <= arg2 /\ 1 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef6, rest remain the same}>
0.00/0.09	<l2, l2, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> 1, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	arg1, arg2, arg3
0.00/0.09	
0.00/0.09	Graph 2:
0.00/0.09	Transitions:
0.00/0.09	<l3, l3, 0 <= undef13 /\ 1 <= arg1 /\ 1 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	arg1, arg2, arg3
0.00/0.09	
0.00/0.09	Precedence: 
0.00/0.09	Graph 0
0.00/0.09	
0.00/0.09	Graph 1
0.00/0.09	<l0, l2, 0 <= undef17 /\ 1 <= undef16 /\ arg2 = undef17 /\ arg3 = 0 /\ 1 + arg1 = undef17, {all remain the same}>
0.00/0.09	
0.00/0.09	Graph 2
0.00/0.09	<l2, l3, arg2 <= 0 /\ 1 <= undef10, {arg1 -> undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}>
0.00/0.09	
0.00/0.09	Map Locations to Subgraph:
0.00/0.09	( 0 , 0 )
0.00/0.09	( 2 , 1 )
0.00/0.09	( 3 , 2 )
0.00/0.09	
0.00/0.09	*******************************************************************************************
0.00/0.09	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Proving termination of subgraph 0
0.00/0.09	Proving termination of subgraph 1
0.00/0.09	Checking unfeasibility...
0.00/0.09	Time used: 0.006126
0.00/0.09	
0.00/0.09	Checking conditional termination of SCC {l2}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000987s
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.003332s
0.00/0.09	Trying to remove transition: <l2, l2, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> 1, rest remain the same}>
0.00/0.09	Solving with 1 template(s).
0.00/0.09	
0.00/0.09	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.09	
0.00/0.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013122s
0.00/0.09	Time used: 0.012892
0.00/0.09	Trying to remove transition: <l2, l2, 1 <= arg2 /\ 1 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef6, rest remain the same}>
0.00/0.09	Solving with 1 template(s).
0.00/0.09	
0.00/0.09	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.09	
0.00/0.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015108s
0.00/0.09	Time used: 0.014501
0.00/0.09	Solving with 1 template(s).
0.00/0.09	
0.00/0.09	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.09	
0.00/0.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020951s
0.00/0.09	Time used: 0.020329
0.00/0.09	
0.00/0.09	LOG: SAT solveNonLinear - Elapsed time: 0.020951s
0.00/0.09	Cost: 0; Total time: 0.020329
0.00/0.09	Termination implied by a set of invariant(s):
0.00/0.09	Invariant at l2: 1 + arg1 <= arg2
0.00/0.09	[ Invariant Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef6, rest remain the same}>
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> 1, rest remain the same}>
0.00/0.09	[ Termination Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef6, rest remain the same}>
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> 1, rest remain the same}>
0.00/0.09	Ranking function: -arg1 + 2*arg2
0.00/0.09	New Graphs: 
0.00/0.09	INVARIANTS: 
0.00/0.09	2: 1 + arg1 <= arg2 , 
0.00/0.09	Quasi-INVARIANTS to narrow Graph: 
0.00/0.09	2: 
0.00/0.09	Proving termination of subgraph 2
0.00/0.09	Checking unfeasibility...
0.00/0.09	Time used: 0.00239
0.00/0.09	
0.00/0.09	Checking conditional termination of SCC {l3}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000996s
0.00/0.09	Ranking function: -1 + arg1
0.00/0.09	New Graphs: 
0.00/0.09	Program Terminates
0.00/0.09	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.09	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.09	EOF