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