0.00/0.02	YES
0.00/0.02	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	No parsing errors!
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l9, true>
0.00/0.03	<l1, l2, (undef2 = (0 + x_5^0)) /\ (undef8 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, ___cil_tmp2_6^0 -> undef2, selected_11^0 -> (0 + undef8)}>
0.00/0.03	<l3, l4, (undef10 = (0 + x_5^0)) /\ (undef16 = (0 + undef10)) /\ (undef9 = undef9), par{Result_4^0 -> undef9, ___cil_tmp2_6^0 -> undef10, retryCount_10^0 -> (1 + retryCount_10^0), selected_11^0 -> (0 + undef16)}>
0.00/0.03	<l4, l5, ((1 + selected_11^0) <= 0)>
0.00/0.03	<l4, l5, (1 <= (0 + selected_11^0))>
0.00/0.03	<l5, l6, (undef33 = (0 + selected_11^0)), par{Result_4^0 -> (0 + undef33), ___cil_tmp6_12^0 -> undef33}>
0.00/0.03	<l4, l7, ((0 + selected_11^0) <= 0) /\ (0 <= (0 + selected_11^0)) /\ (((0 + maxRetries_9^0) + (~(1) * retryCount_10^0)) <= 0) /\ (undef40 = (0 + selected_11^0)), par{Result_4^0 -> (0 + undef40), ___cil_tmp6_12^0 -> undef40}>
0.00/0.03	<l4, l2, ((0 + selected_11^0) <= 0) /\ (0 <= (0 + selected_11^0)) /\ (0 <= ((~(1) + maxRetries_9^0) + (~(1) * retryCount_10^0))) /\ (undef46 = (0 + x_5^0)) /\ (undef52 = (0 + undef46)) /\ (undef45 = undef45), par{Result_4^0 -> undef45, ___cil_tmp2_6^0 -> undef46, selected_11^0 -> (0 + undef52)}>
0.00/0.03	<l2, l4, true, par{retryCount_10^0 -> (1 + retryCount_10^0)}>
0.00/0.03	<l8, l4, true, par{maxRetries_9^0 -> 400, retryCount_10^0 -> 0, selected_11^0 -> 0}>
0.00/0.03	<l9, l8, true>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef2, undef8, undef9, undef10, undef16, undef33, undef40, undef45, undef46, undef52, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef2, undef8, undef9, undef10, undef16, undef33, undef40, undef45, undef46, undef52, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l4, (400 = 400) /\ (retryCount_10^0 = 0) /\ (selected_11^0 = 0)>
0.00/0.03	<l4, l6, ((1 + selected_11^0) <= 0) /\ (undef33 = (0 + selected_11^0))>
0.00/0.03	<l4, l6, (1 <= (0 + selected_11^0)) /\ (undef33 = (0 + selected_11^0))>
0.00/0.03	<l4, l7, ((0 + selected_11^0) <= 0) /\ (0 <= (0 + selected_11^0)) /\ (((0 + 400) + (~(1) * retryCount_10^0)) <= 0) /\ (undef40 = (0 + selected_11^0))>
0.00/0.03	<l4, l4, ((0 + selected_11^0) <= 0) /\ (0 <= (0 + selected_11^0)) /\ (0 <= ((~(1) + 400) + (~(1) * retryCount_10^0))) /\ (undef46 = (0 + x_5^0)) /\ (undef52 = (0 + undef46)) /\ (undef45 = undef45), par{retryCount_10^0 -> (1 + retryCount_10^0), selected_11^0 -> (0 + undef52)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef2, undef8, undef9, undef10, undef16, undef33, undef40, undef45, undef46, undef52, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef2, undef8, undef9, undef10, undef16, undef33, undef40, undef45, undef46, undef52, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l4, l4, retryCount_10^0 <= 399 /\ selected_11^0 = 0 /\ x_5^0 = undef46 /\ undef46 = undef52, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef52, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	retryCount_10^0, selected_11^0, x_5^0
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 3:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l4, l7, 400 <= retryCount_10^0 /\ selected_11^0 = 0 /\ selected_11^0 = undef40, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 3
0.00/0.03	<l4, l6, 1 + selected_11^0 <= 0 /\ selected_11^0 = undef33, {all remain the same}>
0.00/0.03	<l4, l6, 1 <= selected_11^0 /\ selected_11^0 = undef33, {all remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 4 , 1 )
0.00/0.03	( 6 , 3 )
0.00/0.03	( 7 , 2 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.002505
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l4}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.000904s
0.00/0.03	Ranking function: 399 - retryCount_10^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l7}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Proving termination of subgraph 3
0.00/0.03	Analyzing SCC {l6}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF