0.00/0.03	YES
0.00/0.03	
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, true>
0.00/0.03	<l3, l4, ((0 + size1^0) <= (0 + i2^0))>
0.00/0.03	<l3, l5, ((1 + i2^0) <= (0 + size1^0)), par{i2^0 -> (1 + i2^0)}>
0.00/0.03	<l6, l7, true>
0.00/0.03	<l7, l5, ((0 + size1^0) <= (0 + i2^0)), par{i2^0 -> 0}>
0.00/0.03	<l7, l6, ((1 + i2^0) <= (0 + size1^0)), par{i2^0 -> (1 + i2^0)}>
0.00/0.03	<l5, l3, true>
0.00/0.03	<l2, l6, ((0 + size1^0) <= (0 + i2^0)), par{i2^0 -> 0}>
0.00/0.03	<l2, l1, ((1 + i2^0) <= (0 + size1^0)), par{i2^0 -> (1 + i2^0)}>
0.00/0.03	<l8, l1, (undef67 = (0 + __const_10^0)) /\ (undef70 = undef70) /\ (undef69 = undef69), par{i2^0 -> 0, size1010^0 -> (0 + undef67), size1^0 -> undef67, size77^0 -> (0 + undef67), tmp1111^0 -> undef69, tmp88^0 -> undef70}>
0.00/0.03	<l9, l8, true>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef67, undef69, undef70, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef67, undef69, undef70, 
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, l1, (i2^0 = 0) /\ (size1^0 = undef67) /\ (undef67 = (0 + __const_10^0)) /\ (undef70 = undef70) /\ (undef69 = undef69)>
0.00/0.03	<l1, l6, ((0 + size1^0) <= (0 + i2^0)), par{i2^0 -> 0}>
0.00/0.03	<l1, l1, ((1 + i2^0) <= (0 + size1^0)), par{i2^0 -> (1 + i2^0)}>
0.00/0.03	<l5, l4, ((0 + size1^0) <= (0 + i2^0))>
0.00/0.03	<l5, l5, ((1 + i2^0) <= (0 + size1^0)), par{i2^0 -> (1 + i2^0)}>
0.00/0.03	<l6, l5, ((0 + size1^0) <= (0 + i2^0)), par{i2^0 -> 0}>
0.00/0.03	<l6, l6, ((1 + i2^0) <= (0 + size1^0)), par{i2^0 -> (1 + i2^0)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef67, undef69, undef70, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef67, undef69, undef70, 
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	<l1, l1, 1 + i2^0 <= size1^0, {i2^0 -> 1 + i2^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	i2^0, size1^0
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	<l6, l6, 1 + i2^0 <= size1^0, {i2^0 -> 1 + i2^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	i2^0, size1^0
0.00/0.03	
0.00/0.03	Graph 3:
0.00/0.03	Transitions:
0.00/0.03	<l5, l5, 1 + i2^0 <= size1^0, {i2^0 -> 1 + i2^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	i2^0, size1^0
0.00/0.03	
0.00/0.03	Graph 4:
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, l1, __const_10^0 = undef67 /\ i2^0 = 0 /\ size1^0 = undef67, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l1, l6, size1^0 <= i2^0, {i2^0 -> 0, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 3
0.00/0.03	<l6, l5, size1^0 <= i2^0, {i2^0 -> 0, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 4
0.00/0.03	<l5, l4, size1^0 <= i2^0, {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	( 1 , 1 )
0.00/0.03	( 4 , 4 )
0.00/0.03	( 5 , 3 )
0.00/0.03	( 6 , 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.002063
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l1}...
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.000815s
0.00/0.03	Ranking function: -1 - i2^0 + size1^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.001659
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l6}...
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.000802s
0.00/0.03	Ranking function: -1 - i2^0 + size1^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 3
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.001654
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l5}...
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.000834s
0.00/0.03	Ranking function: -1 - i2^0 + size1^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 4
0.00/0.03	Analyzing SCC {l4}...
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