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