0.00/0.04	YES
0.00/0.04	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	No parsing errors!
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l12, true>
0.00/0.04	<l1, l2, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))>
0.00/0.04	<l1, l3, (1 <= (0 + tmp^0))>
0.00/0.04	<l1, l3, ((1 + tmp^0) <= 0)>
0.00/0.04	<l4, l1, (undef27 = undef27), par{ret_foo5^0 -> undef27, tmp^0 -> (0 + undef27), x4^0 -> (0 + il^0)}>
0.00/0.04	<l5, l6, true>
0.00/0.04	<l7, l8, true, par{il^0 -> (1 + il^0)}>
0.00/0.04	<l9, l5, ((0 + tmp___0^0) <= 0) /\ (0 <= (0 + tmp___0^0))>
0.00/0.04	<l9, l7, (1 <= (0 + tmp___0^0))>
0.00/0.04	<l9, l7, ((1 + tmp___0^0) <= 0)>
0.00/0.04	<l8, l10, true>
0.00/0.04	<l10, l5, ((0 + __const_10^0) <= (0 + il^0))>
0.00/0.04	<l10, l9, ((1 + il^0) <= (0 + __const_10^0)) /\ (undef92 = undef92), par{ret_foo7^0 -> undef92, tmp___0^0 -> (0 + undef92), x6^0 -> (0 + il^0)}>
0.00/0.04	<l2, l8, true, par{il^0 -> 0}>
0.00/0.04	<l3, l2, ((0 + __const_10^0) <= (0 + il^0))>
0.00/0.04	<l3, l4, ((1 + il^0) <= (0 + __const_10^0)), par{il^0 -> (1 + il^0)}>
0.00/0.04	<l11, l4, true, par{il^0 -> 0}>
0.00/0.04	<l12, l11, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef27, undef92, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef27, undef92, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l4, (il^0 = 0)>
0.00/0.04	<l4, l8, (undef27 = undef27) /\ ((0 + (0 + undef27)) <= 0) /\ (0 <= (0 + (0 + undef27))), par{il^0 -> 0}>
0.00/0.04	<l4, l8, (undef27 = undef27) /\ (1 <= (0 + (0 + undef27))) /\ ((0 + __const_10^0) <= (0 + il^0)), par{il^0 -> 0}>
0.00/0.04	<l4, l4, (undef27 = undef27) /\ (1 <= (0 + (0 + undef27))) /\ ((1 + il^0) <= (0 + __const_10^0)), par{il^0 -> (1 + il^0)}>
0.00/0.04	<l4, l8, (undef27 = undef27) /\ ((1 + (0 + undef27)) <= 0) /\ ((0 + __const_10^0) <= (0 + il^0)), par{il^0 -> 0}>
0.00/0.04	<l4, l4, (undef27 = undef27) /\ ((1 + (0 + undef27)) <= 0) /\ ((1 + il^0) <= (0 + __const_10^0)), par{il^0 -> (1 + il^0)}>
0.00/0.04	<l8, l6, ((0 + __const_10^0) <= (0 + il^0))>
0.00/0.04	<l8, l6, ((1 + il^0) <= (0 + __const_10^0)) /\ (undef92 = undef92) /\ ((0 + (0 + undef92)) <= 0) /\ (0 <= (0 + (0 + undef92)))>
0.00/0.04	<l8, l8, ((1 + il^0) <= (0 + __const_10^0)) /\ (undef92 = undef92) /\ (1 <= (0 + (0 + undef92))), par{il^0 -> (1 + il^0)}>
0.00/0.04	<l8, l8, ((1 + il^0) <= (0 + __const_10^0)) /\ (undef92 = undef92) /\ ((1 + (0 + undef92)) <= 0), par{il^0 -> (1 + il^0)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef27, undef92, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef27, undef92, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l4, l4, 1 + il^0 <= __const_10^0 /\ 1 <= undef27, {il^0 -> 1 + il^0, rest remain the same}>
0.00/0.04	<l4, l4, 1 + il^0 <= __const_10^0 /\ 1 + undef27 <= 0, {il^0 -> 1 + il^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	__const_10^0, il^0
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	<l8, l8, 1 + il^0 <= __const_10^0 /\ 1 <= undef92, {il^0 -> 1 + il^0, rest remain the same}>
0.00/0.04	<l8, l8, 1 + il^0 <= __const_10^0 /\ 1 + undef92 <= 0, {il^0 -> 1 + il^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	__const_10^0, il^0
0.00/0.04	
0.00/0.04	Graph 3:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Precedence: 
0.00/0.04	Graph 0
0.00/0.04	
0.00/0.04	Graph 1
0.00/0.04	<l0, l4, il^0 = 0, {all remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l4, l8, undef27 = 0, {il^0 -> 0, rest remain the same}>
0.00/0.04	<l4, l8, __const_10^0 <= il^0 /\ 1 <= undef27, {il^0 -> 0, rest remain the same}>
0.00/0.04	<l4, l8, __const_10^0 <= il^0 /\ 1 + undef27 <= 0, {il^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 3
0.00/0.04	<l8, l6, __const_10^0 <= il^0, {all remain the same}>
0.00/0.04	<l8, l6, 1 + il^0 <= __const_10^0 /\ undef92 = 0, {all remain the same}>
0.00/0.04	
0.00/0.04	Map Locations to Subgraph:
0.00/0.04	( 0 , 0 )
0.00/0.04	( 4 , 1 )
0.00/0.04	( 6 , 3 )
0.00/0.04	( 8 , 2 )
0.00/0.04	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Proving termination of subgraph 0
0.00/0.04	Proving termination of subgraph 1
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.003307
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l4}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.001213s
0.00/0.04	Ranking function: -2 + 2*__const_10^0 - 2*il^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.003829
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l8}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.001236s
0.00/0.04	Ranking function: -2 + 2*__const_10^0 - 2*il^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 3
0.00/0.04	Analyzing SCC {l6}...
0.00/0.04	No cycles found.
0.00/0.04	
0.00/0.04	Program Terminates
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.04	EOF