0.00/0.02	YES
0.00/0.02	
0.00/0.02	Solver Timeout: 4
0.00/0.02	Global Timeout: 300
0.00/0.02	No parsing errors!
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l3, true>
0.00/0.02	<l1, l2, (undef1 > 1), par{arg1 -> undef1, arg2 -> 0}>
0.00/0.02	<l2, l2, (arg2 < 10) /\ (arg2 > ~(1)) /\ ((undef3 - 1) <= arg1) /\ (arg1 > 0) /\ (undef3 > 0) /\ ((arg2 + 2) <= arg1), par{arg1 -> undef3, arg2 -> (arg2 + 1)}>
0.00/0.02	<l3, l1, true, par{arg1 -> undef5, arg2 -> undef6}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef1, undef3, undef5, undef6, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef1, undef3, undef5, undef6, 
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	Preprocessed LLVMGraph
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (undef1 > 1)>
0.00/0.02	<l2, l2, (arg2 < 10) /\ (arg2 > ~(1)) /\ ((undef3 - 1) <= arg1) /\ (arg1 > 0) /\ (undef3 > 0) /\ ((arg2 + 2) <= arg1), par{arg1 -> undef3, arg2 -> (arg2 + 1)}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef1, undef3, undef5, undef6, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef1, undef3, undef5, undef6, 
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	*************************************************************
0.00/0.02	*******************************************************************************************
0.00/0.02	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Init Location: 0
0.00/0.02	Graph 0:
0.00/0.02	Transitions:
0.00/0.02	Variables:
0.00/0.02	
0.00/0.02	Graph 1:
0.00/0.02	Transitions:
0.00/0.02	<l2, l2, 1 <= arg1 /\ 1 <= undef3 /\ 0 <= arg2 /\ undef3 <= 1 + arg1 /\ 2 + arg2 <= arg1 /\ arg2 <= 9, {arg1 -> undef3, arg2 -> 1 + arg2, rest remain the same}>
0.00/0.02	Variables:
0.00/0.02	arg1, arg2
0.00/0.02	
0.00/0.02	Precedence: 
0.00/0.02	Graph 0
0.00/0.02	
0.00/0.02	Graph 1
0.00/0.02	<l0, l2, 2 <= undef1 /\ arg1 = undef1 /\ arg2 = 0, {all remain the same}>
0.00/0.02	
0.00/0.02	Map Locations to Subgraph:
0.00/0.02	( 0 , 0 )
0.00/0.02	( 2 , 1 )
0.00/0.02	
0.00/0.02	*******************************************************************************************
0.00/0.02	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Proving termination of subgraph 0
0.00/0.02	Proving termination of subgraph 1
0.00/0.02	Checking unfeasibility...
0.00/0.02	Time used: 0.002349
0.00/0.02	
0.00/0.02	Checking conditional termination of SCC {l2}...
0.00/0.02	
0.00/0.02	LOG: CALL solveLinear
0.00/0.02	
0.00/0.02	LOG: RETURN solveLinear - Elapsed time: 0.001071s
0.00/0.02	Ranking function: 9 - arg2
0.00/0.02	New Graphs: 
0.00/0.02	Program Terminates
0.00/0.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.02	EOF