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, l7, true>
0.00/0.02	<l1, l2, true, par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + tmp7^0)}>
0.00/0.02	<l3, l1, true, par{tmp7^0 -> 0}>
0.00/0.02	<l3, l1, true, par{tmp7^0 -> 1}>
0.00/0.02	<l4, l5, (32 <= (0 + nI6^0)) /\ (undef40 = (0 + res5^0)) /\ (undef36 = (0 + nX^0)) /\ (undef45 = (0 + undef36)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef49 = undef49) /\ (undef38 = undef38) /\ (undef41 = (0 + undef38)), par{nX9^0 -> undef36, res10^0 -> undef38, ret_nBC18^0 -> undef40, ret_nBC211^0 -> undef41, tmp^0 -> (0 + undef40), tmp___0^0 -> (0 + undef41)}>
0.00/0.02	<l4, l3, ((1 + nI6^0) <= 32)>
0.00/0.02	<l2, l4, true>
0.00/0.02	<l6, l2, true, par{nI6^0 -> 0, nX4^0 -> (0 + nX^0), res5^0 -> 0}>
0.00/0.02	<l7, l6, true>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, undef49, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, undef49, 
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, (nI6^0 = 0) /\ (res5^0 = 0)>
0.00/0.02	<l2, l5, (32 <= (0 + nI6^0)) /\ (undef40 = (0 + res5^0)) /\ (undef36 = (0 + nX^0)) /\ (undef45 = (0 + undef36)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef49 = undef49) /\ (undef38 = undef38) /\ (undef41 = (0 + undef38))>
0.00/0.02	<l2, l2, ((1 + nI6^0) <= 32), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 0)}>
0.00/0.02	<l2, l2, ((1 + nI6^0) <= 32), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 1)}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, undef49, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef36, undef38, undef40, undef41, undef45, undef46, undef47, undef48, undef49, 
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.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	<l2, l2, nI6^0 <= 31, {nI6^0 -> 1 + nI6^0, rest remain the same}>
0.00/0.03	<l2, l2, nI6^0 <= 31, {nI6^0 -> 1 + nI6^0, res5^0 -> 1 + res5^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	nI6^0, res5^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	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l2, nI6^0 = 0 /\ res5^0 = 0, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l2, l5, 32 <= nI6^0 /\ nX^0 = undef36 /\ res5^0 = undef40 /\ undef36 = undef45 /\ undef38 = undef41, {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	( 2 , 1 )
0.00/0.03	( 5 , 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.003595
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l2}...
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.000946s
0.00/0.03	Ranking function: 31 - nI6^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l5}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF