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, l15, true>
0.00/0.05	<l1, l2, true>
0.00/0.05	<l3, l4, ((0 + __const_50^0) <= (0 + i^0))>
0.00/0.05	<l3, l5, ((1 + i^0) <= (0 + __const_50^0)), par{i^0 -> (1 + i^0)}>
0.00/0.05	<l6, l7, true>
0.00/0.05	<l8, l5, ((0 + __const_50^0) <= (0 + i13^0)), par{i^0 -> 0}>
0.00/0.05	<l8, l9, ((1 + i13^0) <= (0 + __const_50^0)), par{i13^0 -> (1 + i13^0)}>
0.00/0.05	<l10, l11, true>
0.00/0.05	<l12, l9, ((0 + __const_50^0) <= (0 + i11^0)) /\ (undef65 = 0), par{i13^0 -> 0}>
0.00/0.05	<l12, l13, ((1 + i11^0) <= (0 + __const_50^0)), par{i11^0 -> (1 + i11^0)}>
0.00/0.05	<l13, l12, true>
0.00/0.05	<l11, l13, ((0 + __const_50^0) <= (0 + i^0)) /\ (undef90 = 0), par{i11^0 -> 0}>
0.00/0.05	<l11, l10, ((1 + i^0) <= (0 + __const_50^0)), par{i^0 -> (1 + i^0)}>
0.00/0.05	<l9, l8, true>
0.00/0.05	<l7, l10, ((0 + __const_50^0) <= (0 + i9^0)), par{i^0 -> 0}>
0.00/0.05	<l7, l6, ((1 + i9^0) <= (0 + __const_50^0)), par{i9^0 -> (1 + i9^0)}>
0.00/0.05	<l5, l3, true>
0.00/0.05	<l2, l6, ((0 + __const_50^0) <= (0 + i7^0)) /\ (undef139 = 0), par{i9^0 -> 0}>
0.00/0.05	<l2, l1, ((1 + i7^0) <= (0 + __const_50^0)), par{i7^0 -> (1 + i7^0)}>
0.00/0.05	<l14, l1, (undef154 = undef154) /\ (undef155 = undef155) /\ (undef156 = 0), par{i7^0 -> 0, i^0 -> 0, tmp^0 -> undef154, tmp___0^0 -> undef155}>
0.00/0.05	<l15, l14, true>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef65, undef90, undef139, undef154, undef155, undef156, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef65, undef90, undef139, undef154, undef155, undef156, 
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, l1, (i7^0 = 0) /\ (i^0 = 0) /\ (undef154 = undef154) /\ (undef155 = undef155) /\ (undef156 = 0)>
0.00/0.05	<l1, l6, ((0 + __const_50^0) <= (0 + i7^0)) /\ (undef139 = 0), par{i9^0 -> 0}>
0.00/0.05	<l1, l1, ((1 + i7^0) <= (0 + __const_50^0)), par{i7^0 -> (1 + i7^0)}>
0.00/0.05	<l5, l4, ((0 + __const_50^0) <= (0 + i^0))>
0.00/0.05	<l5, l5, ((1 + i^0) <= (0 + __const_50^0)), par{i^0 -> (1 + i^0)}>
0.00/0.05	<l6, l10, ((0 + __const_50^0) <= (0 + i9^0)), par{i^0 -> 0}>
0.00/0.05	<l6, l6, ((1 + i9^0) <= (0 + __const_50^0)), par{i9^0 -> (1 + i9^0)}>
0.00/0.05	<l9, l5, ((0 + __const_50^0) <= (0 + i13^0)), par{i^0 -> 0}>
0.00/0.05	<l9, l9, ((1 + i13^0) <= (0 + __const_50^0)), par{i13^0 -> (1 + i13^0)}>
0.00/0.05	<l10, l13, ((0 + __const_50^0) <= (0 + i^0)) /\ (undef90 = 0), par{i11^0 -> 0}>
0.00/0.05	<l10, l10, ((1 + i^0) <= (0 + __const_50^0)), par{i^0 -> (1 + i^0)}>
0.00/0.05	<l13, l9, ((0 + __const_50^0) <= (0 + i11^0)) /\ (undef65 = 0), par{i13^0 -> 0}>
0.00/0.05	<l13, l13, ((1 + i11^0) <= (0 + __const_50^0)), par{i11^0 -> (1 + i11^0)}>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef65, undef90, undef139, undef154, undef155, undef156, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef65, undef90, undef139, undef154, undef155, undef156, 
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	<l1, l1, 1 + i7^0 <= __const_50^0, {i7^0 -> 1 + i7^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_50^0, i7^0
0.00/0.05	
0.00/0.05	Graph 2:
0.00/0.05	Transitions:
0.00/0.05	<l6, l6, 1 + i9^0 <= __const_50^0, {i9^0 -> 1 + i9^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_50^0, i9^0
0.00/0.05	
0.00/0.05	Graph 3:
0.00/0.05	Transitions:
0.00/0.05	<l10, l10, 1 + i^0 <= __const_50^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_50^0, i^0
0.00/0.05	
0.00/0.05	Graph 4:
0.00/0.05	Transitions:
0.00/0.05	<l13, l13, 1 + i11^0 <= __const_50^0, {i11^0 -> 1 + i11^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_50^0, i11^0
0.00/0.05	
0.00/0.05	Graph 5:
0.00/0.05	Transitions:
0.00/0.05	<l9, l9, 1 + i13^0 <= __const_50^0, {i13^0 -> 1 + i13^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_50^0, i13^0
0.00/0.05	
0.00/0.05	Graph 6:
0.00/0.05	Transitions:
0.00/0.05	<l5, l5, 1 + i^0 <= __const_50^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	__const_50^0, i^0
0.00/0.05	
0.00/0.05	Graph 7:
0.00/0.05	Transitions:
0.00/0.05	Variables:
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, l1, i7^0 = 0 /\ i^0 = 0 /\ undef156 = 0, {all remain the same}>
0.00/0.05	
0.00/0.05	Graph 2
0.00/0.05	<l1, l6, __const_50^0 <= i7^0 /\ undef139 = 0, {i9^0 -> 0, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 3
0.00/0.05	<l6, l10, __const_50^0 <= i9^0, {i^0 -> 0, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 4
0.00/0.05	<l10, l13, __const_50^0 <= i^0 /\ undef90 = 0, {i11^0 -> 0, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 5
0.00/0.05	<l13, l9, __const_50^0 <= i11^0 /\ undef65 = 0, {i13^0 -> 0, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 6
0.00/0.05	<l9, l5, __const_50^0 <= i13^0, {i^0 -> 0, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 7
0.00/0.05	<l5, l4, __const_50^0 <= i^0, {all 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	( 1 , 1 )
0.00/0.05	( 4 , 7 )
0.00/0.05	( 5 , 6 )
0.00/0.05	( 6 , 2 )
0.00/0.05	( 9 , 5 )
0.00/0.05	( 10 , 3 )
0.00/0.05	( 13 , 4 )
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.00201
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l1}...
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.000861s
0.00/0.05	Ranking function: -1 + __const_50^0 - i7^0
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.001737
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l6}...
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.000867s
0.00/0.05	Ranking function: -1 + __const_50^0 - i9^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 3
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.001663
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l10}...
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.000901s
0.00/0.05	Ranking function: -1 + __const_50^0 - i^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 4
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.00174
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l13}...
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.000941s
0.00/0.05	Ranking function: -1 + __const_50^0 - i11^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 5
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.001717
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l9}...
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.000972s
0.00/0.05	Ranking function: -1 + __const_50^0 - i13^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 6
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.001638
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l5}...
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.000965s
0.00/0.05	Ranking function: -1 + __const_50^0 - i^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 7
0.00/0.05	Analyzing SCC {l4}...
0.00/0.05	No cycles found.
0.00/0.05	
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