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