High level conclusions

Fuzzers reach 46.08% of cyclomatic complexity.

Fuzzers reach 38.10% of all functions.

Fuzzer linear_algos_directed is blocked:

The runtime code coverage of linear_algos_directed covers 29.05% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer write_all_gml is blocked:

The runtime code coverage of write_all_gml covers 29.85% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer read_graphml is blocked:

The runtime code coverage of read_graphml covers 17.69% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer write_all_graphml is blocked:

The runtime code coverage of write_all_graphml covers 29.85% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer misc_algos_weighted is blocked:

The runtime code coverage of misc_algos_weighted covers 28.60% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Reachability and coverage overview

Functions statically reachable by fuzzers

2657 / 6973

Cyclomatic complexity statically reachable by fuzzers

31532 / 68414

Runtime code coverage of functions

1477 / 6973

The following table shows data about each function in the project. The functions included in this table correspond to all functions that exist in the executables of the fuzzers. As such, there may be functions that are from third-party libraries.

For further technical details on the meaning of columns in the below table, please see the Glossary .

Func name	Functions filename	Args	Function call depth	Reached by Fuzzers	Runtime reached by Fuzzers	Combined reached by Fuzzers	Fuzzers runtime hit	Func lines hit %	I Count	BB Count	Cyclomatic complexity	Functions reached	Reached by functions	Accumulated cyclomatic complexity	Undiscovered complexity

Fuzzer: read_edgelist

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	174	38.7%
gold	[1:9]	2	0.44%
yellow	[10:29]	5	1.11%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	268	59.6%
All colors	449	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
43	43	1 : View List ['igraph_vector_int_append']	43	271	igraph_i_eit_create_allfromto	call site: 00291	/src/igraph/src/graph/iterators.c:1699
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00016	/src/igraph/src/core/error.c:212
3	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	3	149	igraph_add_vertices	call site: 00156	/src/igraph/src/graph/type_indexededgelist.c:420
3	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	3	286	igraph_add_edges	call site: 00250	/src/igraph/src/graph/type_indexededgelist.c:318
2	2	1 : View List ['calloc']	10	75	igraph_i_parse_integer	call site: 00063	/src/igraph/src/io/parse_utils.c:65
0	42	1 : View List ['igraph_error']	0	42	igraph_i_attribute_init	call site: 00136	/src/igraph/src/graph/attributes.c:618
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_edges	call site: 00199	/src/igraph/src/graph/type_indexededgelist.c:272
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_vertices	call site: 00145	/src/igraph/src/graph/type_indexededgelist.c:400
0	23	1 : View List ['igraph_errorf']	0	23	igraph_incident	call site: 00298	/src/igraph/src/graph/type_indexededgelist.c:1778
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_int_init	call site: 00015	/src/igraph/src/core/vector.pmt:144
0	21	1 : View List ['igraph_error']	0	21	igraph_edge	call site: 00437	/src/igraph/src/graph/type_common.c:134
0	21	1 : View List ['igraph_error']	0	21	igraph_i_fskip_whitespace	call site: 00045	/src/igraph/src/io/parse_utils.c:165

Runtime coverage analysis

Covered functions

52

Functions that are reachable but not covered

37

Reachable functions

89

Percentage of reachable functions covered

58.43%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_edgelist.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/io/edgelist.c	2
/src/igraph/src/core/vector.pmt	13
/src/igraph/src/core/interruption.c	1
/src/igraph/src/io/parse_utils.c	3
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	9

Fuzzer: read_dl

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	174	24.0%
gold	[1:9]	1	0.13%
yellow	[10:29]	1	0.13%
greenyellow	[30:49]	3	0.41%
lawngreen	50+	543	75.2%
All colors	722	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:202
32	86	3 : View List ['igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size', 'igraph_error']	32	86	igraph_i_attribute_record_list_expand_if_full	call site: 00000	/src/igraph/src/graph/../core/typed_list.pmt:1098
23	23	1 : View List ['igraph_attribute_record_check_type']	23	205	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:151
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:212
10	14	2 : View List ['igraph_fatal', 'igraph_dl_yyrealloc']	10	14	yy_get_next_buffer	call site: 00144	/src/igraph/build/src/io/parsers/dl-lexer.c:1667
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00458	/src/igraph/src/core/error.c:471
2	2	1 : View List ['__errno_location']	2	2	igraph_dl_yylex_init_extra	call site: 00089	/src/igraph/build/src/io/parsers/dl-lexer.c:2436
0	116	2 : View List ['igraph_attribute_record_resize', 'igraph_error']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:161
0	61	2 : View List ['igraph_strvector_resize', 'igraph_error']	0	61	igraph_strvector_append	call site: 00545	/src/igraph/src/core/strvector.c:333
0	49	2 : View List ['igraph_strvector_size', 'igraph_strvector_set']	0	131	igraph_attribute_record_resize	call site: 00000	/src/igraph/src/graph/attributes.c:360
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_edges	call site: 00644	/src/igraph/src/graph/type_indexededgelist.c:272
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_vertices	call site: 00597	/src/igraph/src/graph/type_indexededgelist.c:400

Runtime coverage analysis

Covered functions

151

Functions that are reachable but not covered

33

Reachable functions

167

Percentage of reachable functions covered

80.24%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_dl.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/graph/attributes.c	14
/src/igraph/src/io/dl.c	2
/src/igraph/src/core/vector.pmt	21
/src/igraph/src/core/strvector.c	15
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/build/src/io/parsers/dl-lexer.c	22
/src/igraph/build/src/io/parsers/dl-parser.c	5
/src/igraph/src/io/dl-parser.y	5
/src/igraph/src/io/parse_utils.c	2
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_graphdb

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	55	21.3%
gold	[1:9]	3	1.16%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	200	77.5%
All colors	258	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00183	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00127	/src/igraph/src/graph/type_indexededgelist.c:400
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00013	/src/igraph/src/core/error.c:212
3	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	3	149	igraph_add_vertices	call site: 00140	/src/igraph/src/graph/type_indexededgelist.c:420
3	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	3	286	igraph_add_edges	call site: 00233	/src/igraph/src/graph/type_indexededgelist.c:318
0	42	1 : View List ['igraph_error']	0	42	igraph_i_attribute_init	call site: 00118	/src/igraph/src/graph/attributes.c:618
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_int_init	call site: 00031	/src/igraph/src/core/vector.pmt:144
0	15	1 : View List ['igraph_vector_int_null']	0	15	igraph_i_create_start_vectors	call site: 00241	/src/igraph/src/graph/type_indexededgelist.c:1088
0	0	None	49	1279	igraph_add_edges	call site: 00181	/src/igraph/src/graph/type_indexededgelist.c:266
0	0	None	16	16	IGRAPH_FINALLY_REAL	call site: 00034	/src/igraph/src/core/error.c:321
0	0	None	12	12	IGRAPH_FINALLY_ENTER	call site: 00141	/src/igraph/src/core/error.c:379
0	0	None	3	1127	igraph_add_edges	call site: 00188	/src/igraph/src/graph/type_indexededgelist.c:280

Runtime coverage analysis

Covered functions

42

Functions that are reachable but not covered

24

Reachable functions

66

Percentage of reachable functions covered

63.64%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_graphdb.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/io/graphdb.c	3
/src/igraph/src/core/vector.pmt	12
/src/igraph/src/core/interruption.c	1
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_pajek

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	506	39.9%
gold	[1:9]	2	0.15%
yellow	[10:29]	1	0.07%
greenyellow	[30:49]	1	0.07%
lawngreen	50+	756	59.7%
All colors	1266	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:202
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:212
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00217	/src/igraph/src/core/error.c:471
2	2	1 : View List ['__errno_location']	2	2	igraph_pajek_yylex_init_extra	call site: 00165	/src/igraph/build/src/io/parsers/pajek-lexer.c:2619
0	116	2 : View List ['igraph_attribute_record_resize', 'igraph_error']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:161
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:263
0	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	0	92	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1711
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00800	/src/igraph/src/graph/type_indexededgelist.c:424
0	61	2 : View List ['igraph_strvector_resize', 'igraph_error']	0	61	igraph_strvector_append	call site: 00000	/src/igraph/src/core/strvector.c:333
0	56	1 : View List ['igraph_strvector_append']	0	77	igraph_i_cattribute_get_string_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1773
0	43	1 : View List ['igraph_vector_append']	0	64	igraph_i_cattribute_get_numeric_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1649
0	43	1 : View List ['igraph_vector_bool_append']	0	64	igraph_i_cattribute_get_bool_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1680

Runtime coverage analysis

Covered functions

207

Functions that are reachable but not covered

47

Reachable functions

226

Percentage of reachable functions covered

79.2%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_pajek.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	23
/src/igraph/src/io/pajek.c	4
/src/igraph/src/core/vector.pmt	26
/src/igraph/src/core/trie.c	9
/src/igraph/src/core/strvector.c	12
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/graph/../core/typed_list.pmt	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/bitset.c	5
/src/igraph/build/src/io/parsers/pajek-lexer.c	22
/src/igraph/build/src/io/parsers/pajek-parser.c	5
/src/igraph/src/io/pajek-parser.y	19
/src/igraph/src/io/parse_utils.c	2
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/core/printing.c	1

Fuzzer: read_gml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	219	16.4%
gold	[1:9]	24	1.80%
yellow	[10:29]	1	0.07%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1089	81.6%
All colors	1333	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00010	/src/igraph/src/core/error.c:212
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00351	/src/igraph/src/core/error.c:471
2	2	1 : View List ['__errno_location']	2	2	igraph_gml_yylex_init_extra	call site: 00055	/src/igraph/build/src/io/parsers/gml-lexer.c:2235
0	116	2 : View List ['igraph_attribute_record_resize', 'igraph_error']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:161
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:263
0	86	3 : View List ['igraph_vector_size', 'igraph_vector_reserve', 'igraph_error']	0	86	igraph_vector_push_back	call site: 00000	/src/igraph/src/core/vector.pmt:568
0	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	0	92	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1711
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00918	/src/igraph/src/graph/type_indexededgelist.c:424
0	61	2 : View List ['igraph_strvector_resize', 'igraph_error']	0	61	igraph_strvector_append	call site: 00000	/src/igraph/src/core/strvector.c:333
0	56	1 : View List ['igraph_strvector_append']	0	77	igraph_i_cattribute_get_string_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1773
0	50	2 : View List ['igraph_strvector_init', 'igraph_error']	0	68	igraph_trie_init	call site: 00455	/src/igraph/src/core/trie.c:66
0	49	2 : View List ['igraph_strvector_size', 'igraph_strvector_set']	0	131	igraph_attribute_record_resize	call site: 00718	/src/igraph/src/graph/attributes.c:360

Runtime coverage analysis

Covered functions

229

Functions that are reachable but not covered

46

Reachable functions

239

Percentage of reachable functions covered

80.75%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_gml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/io/gml.c	15
/src/igraph/src/io/gml-tree.c	16
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/core/vector.pmt	32
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	12
/src/igraph/src/core/strvector.c	12
/src/igraph/src/core/trie.c	10
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	3
/src/igraph/src/internal/qsort.c	4

Fuzzer: basic_properties_undirected

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	402	37.3%
gold	[1:9]	2	0.18%
yellow	[10:29]	7	0.64%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	666	61.8%
All colors	1077	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
553	553	1 : View List ['igraph_i_is_eulerian_directed']	574	574	igraph_is_eulerian	call site: 00763	/src/igraph/src/paths/eulerian.c:336
478	492	2 : View List ['igraph_i_connected_components_strong', 'igraph_ecount']	499	513	igraph_is_connected	call site: 00358	/src/igraph/src/connectivity/components.c:464
337	337	1 : View List ['igraph_is_dag']	337	337	igraph_is_acyclic	call site: 00595	/src/igraph/src/properties/trees.c:747
113	269	4 : View List ['igraph_copy', 'igraph_add_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error']	113	424	igraph_is_chordal	call site: 01013	/src/igraph/src/misc/chordality.c:452
56	56	2 : View List ['igraph_vector_bool_resize', 'igraph_error']	56	87	igraph_is_bipartite	call site: 00345	/src/igraph/src/misc/bipartite.c:1073
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:618
24	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:420
24	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:318
23	23	1 : View List ['igraph_errorf']	23	35	igraph_is_chordal	call site: 00947	/src/igraph/src/misc/chordality.c:302
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:400
23	23	1 : View List ['igraph_errorf']	23	23	igraph_neighbors	call site: 00235	/src/igraph/src/graph/type_indexededgelist.c:942

Runtime coverage analysis

Covered functions

94

Functions that are reachable but not covered

34

Reachable functions

128

Percentage of reachable functions covered

73.44%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/basic_properties_undirected.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	19
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	9
/src/igraph/src/graph/attributes.c	5
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/misc/bipartite.c	1
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/connectivity/components.c	6
/src/igraph/src/core/bitset.c	2
/src/igraph/src/graph/adjlist.c	7
/src/igraph/src/graph/iterators.c	4
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/trees.c	6
/src/igraph/src/properties/dag.c	1
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/paths/eulerian.c	3
/src/igraph/src/misc/chordality.c	2
/src/igraph/src/properties/basic_properties.c	1

Fuzzer: read_lgl

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	254	28.0%
gold	[1:9]	1	0.11%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	651	71.8%
All colors	906	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:202
95	116	2 : View List ['igraph_attribute_record_resize', 'igraph_error']	95	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:161
43	43	1 : View List ['igraph_vector_int_append']	43	271	igraph_i_eit_create_allfromto	call site: 00648	/src/igraph/src/graph/iterators.c:1699
35	402	6 : View List ['IGRAPH_FINALLY_REAL', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_size', 'igraph_vector_resize', 'igraph_eit_create', 'igraph_eit_destroy']	35	444	igraph_i_cattribute_get_numeric_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1742
32	86	3 : View List ['igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size', 'igraph_error']	32	86	igraph_i_attribute_record_list_expand_if_full	call site: 00000	/src/igraph/src/graph/../core/typed_list.pmt:1098
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:212
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00795	/src/igraph/src/core/error.c:471
2	2	1 : View List ['__errno_location']	2	2	igraph_lgl_yylex_init_extra	call site: 00085	/src/igraph/build/src/io/parsers/lgl-lexer.c:2169
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:263
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00514	/src/igraph/src/graph/type_indexededgelist.c:424
0	61	2 : View List ['igraph_strvector_resize', 'igraph_error']	0	61	igraph_strvector_append	call site: 00445	/src/igraph/src/core/strvector.c:333
0	23	1 : View List ['igraph_attribute_record_check_type']	95	205	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:151

Runtime coverage analysis

Covered functions

169

Functions that are reachable but not covered

42

Reachable functions

186

Percentage of reachable functions covered

77.42%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_lgl.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	18
/src/igraph/src/io/lgl.c	4
/src/igraph/src/core/vector.pmt	21
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/core/memory.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/core/printing.c	1

Fuzzer: vertex_connectivity

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	647	46.0%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	759	53.9%
All colors	1406	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
807	1927	23 : View List ['igraph_vector_int_tail', 'igraph_buckets_empty', 'igraph_vector_int_empty', 'igraph_dqueue_int_pop', 'igraph_vector_int_init', 'igraph_vector_init', 'igraph_is_dag', 'igraph_dqueue_int_push', 'igraph_vector_int_size', 'igraph_error', 'igraph_dqueue_int_empty', 'IGRAPH_FINALLY_REAL', 'igraph_destroy', 'igraph_dqueue_int_init', 'igraph_vector_int_null', 'igraph_buckets_clear', 'igraph_vector_resize', 'igraph_vector_int_pop_back', 'igraph_create', 'igraph_vector_int_push_back', 'igraph_buckets_popmax', 'igraph_vector_int_clear', 'igraph_buckets_add']	807	2258	igraph_maxflow	call site: 00798	/src/igraph/src/flow/flow.c:751
175	193	5 : View List ['IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	281	igraph_to_undirected	call site: 01311	/src/igraph/src/misc/conversion.c:627
43	113	3 : View List ['igraph_vector_bool_init', 'igraph_vector_int_resize', 'igraph_vector_bool_destroy']	1009	2787	igraph_maxflow	call site: 00798	/src/igraph/src/flow/flow.c:681
42	86	3 : View List ['igraph_vector_int_reserve', 'igraph_vector_int_size', 'igraph_error']	42	86	igraph_vector_int_push_back	call site: 00155	/src/igraph/src/core/vector.pmt:568
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:618
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01167	/src/igraph/src/graph/attributes.c:637
33	385	4 : View List ['igraph_es_all', 'igraph_eit_destroy', 'igraph_eit_create', 'igraph_es_destroy']	180	1003	igraph_to_undirected	call site: 01251	/src/igraph/src/misc/conversion.c:502
24	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:420
24	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:318
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:400
23	23	1 : View List ['igraph_errorf']	23	23	igraph_neighbors	call site: 00272	/src/igraph/src/graph/type_indexededgelist.c:942

Runtime coverage analysis

Covered functions

111

Functions that are reachable but not covered

64

Reachable functions

175

Percentage of reachable functions covered

63.43%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/vertex_connectivity.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	27
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	14
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	8
/src/igraph/src/core/vector.c	2
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	3
/src/igraph/src/graph/iterators.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/flow/flow_conversion.c	1
/src/igraph/src/misc/conversion.c	3
/src/igraph/src/graph/basic_query.c	1
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	1
/src/igraph/src/random/random.c	11
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8

Fuzzer: basic_properties_directed

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	241	27.2%
gold	[1:9]	0	0.0%
yellow	[10:29]	7	0.79%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	635	71.9%
All colors	883	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
550	550	1 : View List ['igraph_i_is_eulerian_undirected']	571	571	igraph_is_eulerian	call site: 00756	/src/igraph/src/paths/eulerian.c:336
242	242	1 : View List ['igraph_i_is_connected_weak']	263	263	igraph_is_connected	call site: 00337	/src/igraph/src/connectivity/components.c:464
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:618
24	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:420
24	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:318
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:400
23	23	1 : View List ['igraph_errorf']	23	23	igraph_neighbors	call site: 00235	/src/igraph/src/graph/type_indexededgelist.c:942
21	62	2 : View List ['igraph_vector_int_push_back', 'igraph_error']	21	62	igraph_i_is_forest	call site: 00627	/src/igraph/src/properties/trees.c:605
21	21	1 : View List ['igraph_error']	21	21	igraph_stack_int_init	call site: 00638	/src/igraph/src/core/stack.pmt:50
21	21	1 : View List ['igraph_error']	21	21	igraph_vector_int_init	call site: 00010	/src/igraph/src/core/vector.pmt:144
10	10	1 : View List ['igraph_fatal']	10	69	igraph_degree	call site: 00491	/src/igraph/src/graph/type_indexededgelist.c:1315

Runtime coverage analysis

Covered functions

93

Functions that are reachable but not covered

22

Reachable functions

115

Percentage of reachable functions covered

80.87%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/basic_properties_directed.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	10
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/graph/adjlist.c	7
/src/igraph/src/properties/complete.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/graph/iterators.c	4
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/dag.c	1
/src/igraph/src/properties/trees.c	5
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/paths/eulerian.c	3
/src/igraph/src/properties/basic_properties.c	1

Fuzzer: read_dimacs_flow

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	42	12.7%
gold	[1:9]	3	0.90%
yellow	[10:29]	5	1.51%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	280	84.8%
All colors	330	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:202
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00010	/src/igraph/src/core/error.c:212
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00210	/src/igraph/src/graph/type_indexededgelist.c:424
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_edges	call site: 00249	/src/igraph/src/graph/type_indexededgelist.c:272
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_vertices	call site: 00199	/src/igraph/src/graph/type_indexededgelist.c:400
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_init	call site: 00030	/src/igraph/src/core/vector.pmt:144
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_int_init	call site: 00027	/src/igraph/src/core/vector.pmt:144
0	21	1 : View List ['igraph_error']	0	21	igraph_i_attribute_init	call site: 00191	/src/igraph/src/graph/attributes.c:620
0	21	1 : View List ['igraph_error']	0	21	igraph_add_vertices	call site: 00213	/src/igraph/src/graph/type_indexededgelist.c:431
0	15	1 : View List ['igraph_vector_int_null']	0	15	igraph_i_create_start_vectors	call site: 00308	/src/igraph/src/graph/type_indexededgelist.c:1088
0	0	None	16	16	IGRAPH_FINALLY_REAL	call site: 00035	/src/igraph/src/core/error.c:321
0	0	None	12	12	IGRAPH_FINALLY_ENTER	call site: 00207	/src/igraph/src/core/error.c:379

Runtime coverage analysis

Covered functions

71

Functions that are reachable but not covered

24

Reachable functions

83

Percentage of reachable functions covered

71.08%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_dimacs_flow.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/graph/attributes.c	5
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/vector.pmt	19
/src/igraph/src/io/dimacs.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: vertex_separators

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	630	23.1%
gold	[1:9]	0	0.0%
yellow	[10:29]	1	0.03%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	2089	76.8%
All colors	2720	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
175	206	6 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	301	igraph_simplify	call site: 01707	/src/igraph/src/operators/simplify.c:176
126	524	7 : View List ['igraph_dqueue_int_head', 'igraph_dqueue_int_empty', 'igraph_dqueue_int_pop', 'igraph_i_lazy_adjlist_get_real', 'igraph_vector_int_size', 'igraph_dqueue_int_push', 'igraph_error']	126	585	igraph_bfs	call site: 02173	/src/igraph/src/graph/visitors.c:201
97	305	9 : View List ['igraph_vector_int_destroy', 'igraph_vector_int_list_init', 'IGRAPH_FINALLY_REAL', 'igraph_i_attribute_combine_vertices', 'igraph_vector_int_list_destroy', 'igraph_vector_int_init', 'igraph_vector_int_list_get_ptr', 'igraph_vector_int_push_back', 'igraph_error']	97	362	igraph_contract_vertices	call site: 01916	/src/igraph/src/operators/contract.c:120
87	181	7 : View List ['igraph_i_attribute_copy', 'IGRAPH_FINALLY_REAL', 'igraph_i_attribute_permute_vertices', 'igraph_vector_int_init', 'igraph_vector_int_size', 'igraph_i_attribute_get_info', 'igraph_error']	87	256	igraph_permute_vertices	call site: 01989	/src/igraph/src/operators/permute.c:111
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:618
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01367	/src/igraph/src/graph/attributes.c:637
24	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:420
24	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:318
23	35	2 : View List ['igraph_errorf', 'igraph_vector_int_size']	23	35	igraph_contract_vertices	call site: 01899	/src/igraph/src/operators/contract.c:73
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:400
23	23	1 : View List ['igraph_errorf']	23	23	igraph_neighbors	call site: 00274	/src/igraph/src/graph/type_indexededgelist.c:942

Runtime coverage analysis

Covered functions

247

Functions that are reachable but not covered

48

Reachable functions

295

Percentage of reachable functions covered

83.73%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/vertex_separators.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	43
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	11
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	21
/src/igraph/src/connectivity/separators.c	10
/src/igraph/src/graph/adjlist.c	10
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	11
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	7
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/flow/flow_conversion.c	1
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/graph/basic_query.c	1
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	2
/src/igraph/src/random/random.c	11
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/flow/st-cuts.c	8
/src/igraph/src/operators/contract.c	1
/src/igraph/src/operators/permute.c	2
/src/igraph/src/core/marked_queue.c	8
/src/igraph/src/core/estack.c	5
/src/igraph/src/graph/visitors.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/connectivity/cohesive_blocks.c	4
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/operators/subgraph.c	5
/src/igraph/src/properties/degrees.c	1

Fuzzer: weighted_community

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1278	33.4%
gold	[1:9]	5	0.13%
yellow	[10:29]	5	0.13%
greenyellow	[30:49]	2	0.05%
lawngreen	50+	2528	66.2%
All colors	3818	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
586	586	2 : View List ['estimate_minmax_r', 'brent_opt']	628	734	igraph_community_voronoi	call site: 02325	/src/igraph/src/community/voronoi.c:615
523	523	1 : View List ['igraph_i_ecc3_2']	523	523	igraph_ecc	call site: 02224	/src/igraph/src/properties/ecc.c:372
478	492	2 : View List ['igraph_i_connected_components_strong', 'igraph_ecount']	499	513	igraph_is_connected	call site: 03260	/src/igraph/src/connectivity/components.c:464
464	464	1 : View List ['igraph_i_voronoi']	485	547	igraph_voronoi	call site: 02430	/src/igraph/src/paths/voronoi.c:408
168	742	13 : View List ['igraph_vector_int_shuffle', 'igraph_dqueue_int_empty', 'IGRAPH_FINALLY_REAL', 'igraph_vector_int_init_range', 'igraph_dqueue_int_init', 'igraph_dqueue_int_pop', 'igraph_neighbors', 'igraph_vector_int_init', 'igraph_vector_int_resize', 'igraph_dqueue_int_destroy', 'igraph_vector_int_size', 'igraph_dqueue_int_push', 'igraph_error']	168	848	igraph_community_label_propagation	call site: 00848	/src/igraph/src/community/label_propagation.c:695
105	830	10 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'IGRAPH_FINALLY_CLEAN', 'igraph_edge', 'igraph_vector_int_init', 'igraph_matrix_int_resize', 'igraph_connected_components', 'igraph_vector_int_resize', 'igraph_vector_int_size', 'igraph_error']	105	830	igraph_community_eb_get_merges	call site: 01360	/src/igraph/src/community/edge_betweenness.c:265
105	605	12 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_vit_create', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_null', 'igraph_vector_resize', 'igraph_vector_int_init', 'igraph_vector_int_reserve', 'igraph_vit_destroy', 'igraph_error', 'igraph_incident', 'igraph_vector_int_size']	105	605	igraph_strength	call site: 00489	/src/igraph/src/properties/degrees.c:649
105	105	1 : View List ['igraph_error']	105	105	igraph_attribute_record_check_type	call site: 00256	/src/igraph/src/graph/attributes.c:263
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 01250	/src/igraph/src/core/stack.pmt:212
74	86	3 : View List ['igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size', 'igraph_error']	74	86	igraph_i_attribute_record_list_expand_if_full	call site: 00266	/src/igraph/src/graph/../core/typed_list.pmt:1098
50	134	4 : View List ['igraph_2wheap_init', 'igraph_vector_size', 'igraph_inclist_init_empty', 'igraph_vector_min']	526	2579	igraph_community_edge_betweenness	call site: 01178	/src/igraph/src/community/edge_betweenness.c:534
45	45	1 : View List ['igraph_i_sparsemat_colsums_cc']	45	45	igraph_sparsemat_colsums	call site: 01641	/src/igraph/src/core/sparsemat.c:2811

Runtime coverage analysis

Covered functions

490

Functions that are reachable but not covered

138

Reachable functions

740

Percentage of reachable functions covered

81.35%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/weighted_community.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	62
/src/igraph/src/graph/attributes.c	26
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/matrix.pmt	13
/src/igraph/src/graph/cattributes.c	9
/src/igraph/src/graph/../core/typed_list.pmt	8
/src/igraph/src/core/strvector.c	8
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/community/label_propagation.c	3
/src/igraph/src/graph/adjlist.c	10
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	8
/src/igraph/src/community/walktrap/walktrap.cpp	1
/src/igraph/src/community/walktrap/walktrap_graph.cpp	8
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/community/walktrap/walktrap_communities.cpp	17
/src/igraph/src/community/walktrap/walktrap_heap.cpp	9
/src/igraph/src/community/community_misc.c	9
/src/igraph/src/community/edge_betweenness.c	5
/src/igraph/src/core/indheap.c	16
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/math/utils.c	1
/src/igraph/src/community/modularity.c	3
/src/igraph/src/core/sparsemat.c	24
/src/igraph/vendor/cs/cs_util.c	4
/src/igraph/vendor/cs/cs_malloc.c	4
/src/igraph/vendor/cs/cs_entry.c	1
/src/igraph/vendor/cs/cs_compress.c	1
/src/igraph/vendor/cs/cs_cumsum.c	1
/src/igraph/vendor/cs/cs_dupl.c	1
/src/igraph/src/operators/contract.c	1
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/community/voronoi.c	9
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/paths/voronoi.c	3
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/community/fast_modularity.c	12
/src/igraph/src/community/leiden.c	8
/src/igraph/src/community/louvain.c	9
/src/igraph/src/community/spinglass/clustertool.cpp	3
/src/igraph/src/community/spinglass/NetDataTypes.h	101
/src/igraph/src/community/spinglass/NetRoutines.cpp	1
/src/igraph/src/community/spinglass/NetDataTypes.cpp	4
/src/igraph/src/community/spinglass/pottsmodel_2.cpp	17
/src/igraph/src/community/spinglass/pottsmodel_2.h	3

Fuzzer: read_ncol

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	295	32.7%
gold	[1:9]	1	0.11%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	605	67.1%
All colors	901	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
232	370	8 : View List ['IGRAPH_FINALLY_REAL', 'igraph_vit_create', 'igraph_strvector_resize', 'IGRAPH_FINALLY_CLEAN', 'igraph_vit_destroy', 'igraph_strvector_size', 'igraph_strvector_set', 'igraph_strvector_get']	232	433	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1711
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:202
95	116	2 : View List ['igraph_attribute_record_resize', 'igraph_error']	95	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:161
35	402	6 : View List ['IGRAPH_FINALLY_REAL', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_size', 'igraph_vector_resize', 'igraph_eit_create', 'igraph_eit_destroy']	35	444	igraph_i_cattribute_get_numeric_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1742
32	86	3 : View List ['igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size', 'igraph_error']	32	86	igraph_i_attribute_record_list_expand_if_full	call site: 00000	/src/igraph/src/graph/../core/typed_list.pmt:1098
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:212
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00243	/src/igraph/src/core/error.c:471
2	2	1 : View List ['__errno_location']	2	2	igraph_ncol_yylex_init_extra	call site: 00249	/src/igraph/build/src/io/parsers/ncol-lexer.c:2163
0	224	3 : View List ['igraph_strvector_size', 'igraph_trie_get', 'igraph_strvector_get']	16	2216	igraph_read_graph_ncol	call site: 00081	/src/igraph/src/io/ncol.c:129
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:263
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00528	/src/igraph/src/graph/type_indexededgelist.c:424
0	61	2 : View List ['igraph_strvector_resize', 'igraph_error']	0	61	igraph_strvector_append	call site: 00453	/src/igraph/src/core/strvector.c:333

Runtime coverage analysis

Covered functions

164

Functions that are reachable but not covered

45

Reachable functions

186

Percentage of reachable functions covered

75.81%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_ncol.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	18
/src/igraph/src/io/ncol.c	4
/src/igraph/src/core/vector.pmt	23
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/core/memory.c	1
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	10
/src/igraph/src/core/printing.c	1

Fuzzer: bliss

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	186	29.0%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	454	70.9%
All colors	640	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
44	56	3 : View List ['igraph_errorf', 'igraph_vector_int_size', 'igraph_error']	44	56	(anonymousnamespace)::bliss_set_colors(bliss::AbstractGraph*,igraph_vector_int_tconst*)	call site: 00000	/src/igraph/src/isomorphism/bliss.cc:144
42	86	3 : View List ['igraph_vector_int_reserve', 'igraph_vector_int_size', 'igraph_error']	42	86	igraph_vector_int_push_back	call site: 00155	/src/igraph/src/core/vector.pmt:568
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:618
24	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:420
24	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:318
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:400
23	23	1 : View List ['igraph_errorf']	23	23	igraph_neighbors	call site: 00236	/src/igraph/src/graph/type_indexededgelist.c:942
21	21	1 : View List ['igraph_error']	21	21	igraph_vector_int_init	call site: 00010	/src/igraph/src/core/vector.pmt:144
10	10	1 : View List ['igraph_fatal']	10	10	igraph_i_property_cache_set_bool_checked	call site: 00253	/src/igraph/src/graph/caching.c:127
8	8	4 : View List ['std::runtime_error::runtime_error(char const*)', '__cxa_allocate_exception', '__cxa_throw', '__cxa_free_exception']	8	8	(anonymousnamespace)::bliss_from_igraph(igraph_tconst*)	call site: 00000	/src/igraph/src/isomorphism/bliss.cc:83
8	8	4 : View List ['std::runtime_error::runtime_error(char const*)', '__cxa_allocate_exception', '__cxa_throw', '__cxa_free_exception']	8	8	bliss::Digraph::add_edge(unsignedint,unsignedint)	call site: 00000	/src/igraph/src/isomorphism/bliss/graph.cc:1909

Runtime coverage analysis

Covered functions

231

Functions that are reachable but not covered

72

Reachable functions

315

Percentage of reachable functions covered

77.14%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/bliss.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	11
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	9
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	1
/src/igraph/src/core/typed_list.pmt	7
/src/igraph/src/isomorphism/bliss.cc	7
/src/igraph/src/isomorphism/bliss/graph.cc	23
/src/igraph/src/isomorphism/bliss/partition.cc	16
/src/igraph/src/isomorphism/bliss/kstack.hh	6
/src/igraph/src/isomorphism/bliss/kqueue.hh	7
/src/igraph/src/isomorphism/bliss/heap.cc	3
/src/igraph/src/isomorphism/bliss/uintseqhash.hh	5
/src/igraph/src/isomorphism/bliss/orbit.cc	9
/src/igraph/src/isomorphism/bliss/graph.hh	3
/src/igraph/src/isomorphism/bliss/stats.hh	10
/src/igraph/src/isomorphism/bliss/bignum.hh	5
/src/igraph/vendor/mini-gmp/mini-gmp.c	32
/src/igraph/src/isomorphism/bliss/partition.hh	8
/src/igraph/src/isomorphism/bliss/uintseqhash.cc	1
/src/igraph/src/isomorphism/bliss/orbit.hh	1

Fuzzer: misc_algos_weighted

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	4520	72.6%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1701	27.3%
All colors	6221	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
608	608	1 : View List ['igraph_i_diameter_unweighted']	608	608	igraph_diameter	call site: 01126	/src/igraph/src/paths/shortest_paths.c:1264
430	430	1 : View List ['igraph_i_average_path_length_unweighted']	430	430	igraph_average_path_length	call site: 01442	/src/igraph/src/paths/shortest_paths.c:333
419	419	1 : View List ['igraph_i_pseudo_diameter_unweighted']	419	419	igraph_pseudo_diameter	call site: 00867	/src/igraph/src/paths/distances.c:797
367	367	3 : View List ['igraph_i_eccentricity_unweighted', 'igraph_lazy_adjlist_destroy', 'igraph_lazy_adjlist_init']	409	445	igraph_eccentricity	call site: 01513	/src/igraph/src/paths/distances.c:267
259	259	1 : View List ['igraph_i_random_walk_adjlist']	259	259	igraph_random_walk	call site: 05350	/src/igraph/src/paths/random_walk.c:341
210	1596	17 : View List ['igraph_maxdegree', 'igraph_vector_int_destroy', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_int_init', 'igraph_vit_destroy', 'igraph_degree', 'igraph_vector_destroy', 'igraph_vector_init', 'igraph_error', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_vit_create', 'igraph_vector_null', 'igraph_neighbors', 'igraph_vector_resize', 'igraph_vss_all', 'igraph_vector_int_clear']	210	1596	igraph_avg_nearest_neighbor_degree	call site: 00759	/src/igraph/src/properties/degrees.c:281
180	442	8 : View List ['igraph_vector_int_sort_ind', 'IGRAPH_FINALLY_REAL', 'igraph_neighbors', 'igraph_vector_int_init', 'igraph_vector_int_resize', 'igraph_error', 'igraph_vector_int_null', 'igraph_vector_int_size']	180	517	igraph_i_feedback_arc_set_eades	call site: 05317	/src/igraph/src/misc/feedback_arc_set.c:715
171	171	1 : View List ['igraph_i_minimum_spanning_tree_unweighted']	171	171	igraph_i_minimum_spanning_tree_prim	call site: 01606	/src/igraph/src/misc/spanning_trees.c:188
171	171	1 : View List ['igraph_i_minimum_spanning_tree_unweighted']	171	171	igraph_i_minimum_spanning_tree_kruskal	call site: 01700	/src/igraph/src/misc/spanning_trees.c:348
105	605	12 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_vit_create', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_null', 'igraph_vector_resize', 'igraph_vector_int_init', 'igraph_vector_int_reserve', 'igraph_vit_destroy', 'igraph_error', 'igraph_incident', 'igraph_vector_int_size']	105	605	igraph_strength	call site: 00386	/src/igraph/src/properties/degrees.c:649
105	105	1 : View List ['igraph_error']	105	105	igraph_attribute_record_check_type	call site: 05787	/src/igraph/src/graph/attributes.c:263
74	86	3 : View List ['igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size', 'igraph_error']	74	86	igraph_i_attribute_record_list_expand_if_full	call site: 05795	/src/igraph/src/graph/../core/typed_list.pmt:1098

Runtime coverage analysis

Covered functions

285

Functions that are reachable but not covered

654

Reachable functions

916

Percentage of reachable functions covered

28.6%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/misc_algos_weighted.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	60
/src/igraph/src/graph/attributes.c	22
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	13
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	18
/src/igraph/src/core/matrix.pmt	7
/src/igraph/src/misc/conversion.c	3
/src/igraph/src/properties/spectral.c	2
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/properties/degrees.c	6
/src/igraph/src/misc/mixing.c	3
/src/igraph/src/paths/distances.c	7
/src/igraph/src/graph/adjlist.c	16
/src/igraph/src/core/indheap.c	27
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/paths/shortest_paths.c	10
/src/igraph/src/core/progress.c	1
/src/igraph/src/paths/dijkstra.c	4
/src/igraph/src/paths/unweighted.c	4
/src/igraph/src/misc/feedback_arc_set.c	9
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/core/bitset.c	4
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/graph/visitors.c	1
/src/igraph/src/properties/dag.c	1
/src/igraph/vendor/glpk/env/error.c	4
/src/igraph/vendor/glpk/env/env.c	4
/src/igraph/vendor/glpk/env/tls.c	2
/src/igraph/src/internal/glpk_support.c	4
/src/igraph/vendor/glpk/env/dlsup.c	1
/src/igraph/vendor/glpk/env/stdout.c	4
/src/igraph/vendor/glpk/draft/glpapi09.c	12
/src/igraph/vendor/glpk/api/prob1.c	19
/src/igraph/vendor/glpk/env/alloc.c	5
/src/igraph/vendor/glpk/misc/dmp.c	5
/src/igraph/vendor/glpk/misc/avl.c	6
/src/igraph/vendor/glpk/draft/bfd.c	11
/src/igraph/vendor/glpk/bflib/fhvint.c	7
/src/igraph/vendor/glpk/bflib/lufint.c	3
/src/igraph/vendor/glpk/bflib/sva.c	9
/src/igraph/vendor/glpk/bflib/scfint.c	7
/src/igraph/vendor/glpk/bflib/btfint.c	5
/src/igraph/src/core/stack.pmt	8
/src/igraph/vendor/glpk/draft/glpapi06.c	14
/src/igraph/vendor/glpk/draft/glpios01.c	21
/src/igraph/vendor/glpk/env/time.c	2
/src/igraph/vendor/glpk/env/stdc.c	1
/src/igraph/vendor/glpk/misc/jd.c	2
/src/igraph/vendor/glpk/draft/glpios03.c	16
/src/igraph/vendor/glpk/draft/glpios12.c	4
/src/igraph/vendor/glpk/api/prob5.c	3
/src/igraph/vendor/glpk/api/prob4.c	5
/src/igraph/vendor/glpk/intopt/mirgen.c	21
/src/igraph/vendor/glpk/intopt/spv.c	8
/src/igraph/vendor/glpk/intopt/covgen.c	14
/src/igraph/vendor/glpk/api/prob2.c	12
/src/igraph/vendor/glpk/misc/fvs.c	6
/src/igraph/vendor/glpk/intopt/cfg2.c	2
/src/igraph/vendor/glpk/intopt/cfg1.c	9
/src/igraph/vendor/glpk/intopt/cfg.c	7
/src/igraph/vendor/glpk/draft/glpios02.c	8
/src/igraph/vendor/glpk/draft/glpapi12.c	13
/src/igraph/vendor/glpk/bflib/luf.c	10
/src/igraph/vendor/glpk/bflib/sgf.c	7
/src/igraph/vendor/glpk/bflib/btf.c	7
/src/igraph/vendor/glpk/misc/mc21a.c	1
/src/igraph/vendor/glpk/misc/mc13d.c	1
/src/igraph/vendor/glpk/simplex/spxprim.c	10
/src/igraph/vendor/glpk/simplex/spxprob.c	7
/src/igraph/vendor/glpk/simplex/spxat.c	6
/src/igraph/vendor/glpk/simplex/spxnt.c	8
/src/igraph/vendor/glpk/simplex/spxchuzc.c	7
/src/igraph/vendor/glpk/simplex/spxlp.c	12
/src/igraph/vendor/glpk/bflib/fhv.c	3
/src/igraph/vendor/glpk/bflib/scf.c	11
/src/igraph/vendor/glpk/bflib/ifu.c	6
/src/igraph/vendor/glpk/simplex/spxchuzr.c	5
/src/igraph/vendor/glpk/simplex/spydual.c	12
/src/igraph/vendor/glpk/simplex/spychuzr.c	7
/src/igraph/vendor/glpk/simplex/spychuzc.c	5
/src/igraph/vendor/glpk/npp/npp1.c	21
/src/igraph/vendor/glpk/npp/npp5.c	7
/src/igraph/vendor/glpk/npp/npp2.c	10
/src/igraph/vendor/glpk/npp/npp3.c	20
/src/igraph/vendor/glpk/draft/glpscl.c	13
/src/igraph/vendor/glpk/misc/round2n.c	1
/src/igraph/vendor/glpk/api/advbas.c	2
/src/igraph/vendor/glpk/misc/triang.c	1
/src/igraph/vendor/glpk/misc/gcd.c	2
/src/igraph/vendor/glpk/intopt/fpump.c	2
/src/igraph/vendor/glpk/misc/rng.c	5
/src/igraph/vendor/glpk/misc/rng1.c	2
/src/igraph/vendor/glpk/draft/glpapi13.c	3
/src/igraph/vendor/glpk/proxy/proxy1.c	1
/src/igraph/vendor/glpk/proxy/proxy.c	16
/src/igraph/vendor/glpk/npp/npp4.c	10
/src/igraph/vendor/glpk/draft/glpios09.c	12
/src/igraph/vendor/glpk/draft/glpapi10.c	1
/src/igraph/vendor/glpk/intopt/gmigen.c	2
/src/igraph/vendor/glpk/intopt/gmicut.c	1
/src/igraph/vendor/glpk/misc/ks.c	8
/src/igraph/vendor/glpk/misc/mt1.c	3
/src/igraph/vendor/glpk/intopt/clqcut.c	1
/src/igraph/vendor/glpk/misc/wclique.c	2
/src/igraph/vendor/glpk/misc/wclique1.c	2
/src/igraph/vendor/glpk/draft/glpios11.c	3
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/paths/random_walk.c	4
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/paths/bellman_ford.c	1
/src/igraph/src/paths/widest_paths.c	1
/src/igraph/src/misc/other.c	1
/src/igraph/src/graph/cattributes.c	7
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/sparsifier.c	3

Fuzzer: community

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1172	36.6%
gold	[1:9]	5	0.15%
yellow	[10:29]	2	0.06%
greenyellow	[30:49]	2	0.06%
lawngreen	50+	2014	63.0%
All colors	3195	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
586	586	2 : View List ['estimate_minmax_r', 'brent_opt']	628	734	igraph_community_voronoi	call site: 02149	/src/igraph/src/community/voronoi.c:615
523	523	1 : View List ['igraph_i_ecc3_2']	523	523	igraph_ecc	call site: 02048	/src/igraph/src/properties/ecc.c:372
478	492	2 : View List ['igraph_i_connected_components_strong', 'igraph_ecount']	499	513	igraph_is_connected	call site: 03099	/src/igraph/src/connectivity/components.c:464
464	464	1 : View List ['igraph_i_voronoi']	485	547	igraph_voronoi	call site: 02255	/src/igraph/src/paths/voronoi.c:408
240	240	1 : View List ['igraph_has_mutual']	553	2258	igraph_community_fluid_communities	call site: 03137	/src/igraph/src/community/fluid.c:94
175	206	6 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	301	igraph_simplify	call site: 01899	/src/igraph/src/operators/simplify.c:176
175	193	5 : View List ['IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	281	igraph_to_undirected	call site: 02419	/src/igraph/src/misc/conversion.c:627
168	742	13 : View List ['igraph_vector_int_shuffle', 'igraph_dqueue_int_empty', 'IGRAPH_FINALLY_REAL', 'igraph_vector_int_init_range', 'igraph_dqueue_int_init', 'igraph_dqueue_int_pop', 'igraph_neighbors', 'igraph_vector_int_init', 'igraph_vector_int_resize', 'igraph_dqueue_int_destroy', 'igraph_vector_int_size', 'igraph_dqueue_int_push', 'igraph_error']	168	848	igraph_community_label_propagation	call site: 00619	/src/igraph/src/community/label_propagation.c:695
109	305	9 : View List ['igraph_vector_int_destroy', 'igraph_vector_int_list_init', 'IGRAPH_FINALLY_REAL', 'igraph_i_attribute_combine_vertices', 'igraph_vector_int_list_destroy', 'igraph_vector_int_init', 'igraph_vector_int_list_get_ptr', 'igraph_vector_int_push_back', 'igraph_error']	109	362	igraph_contract_vertices	call site: 01519	/src/igraph/src/operators/contract.c:120
105	830	10 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'IGRAPH_FINALLY_CLEAN', 'igraph_edge', 'igraph_vector_int_init', 'igraph_matrix_int_resize', 'igraph_connected_components', 'igraph_vector_int_resize', 'igraph_vector_int_size', 'igraph_error']	105	830	igraph_community_eb_get_merges	call site: 01146	/src/igraph/src/community/edge_betweenness.c:265
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 01035	/src/igraph/src/core/stack.pmt:212
50	134	4 : View List ['igraph_2wheap_init', 'igraph_vector_size', 'igraph_inclist_init_empty', 'igraph_vector_min']	526	2579	igraph_community_edge_betweenness	call site: 00960	/src/igraph/src/community/edge_betweenness.c:534

Runtime coverage analysis

Covered functions

307

Functions that are reachable but not covered

95

Reachable functions

433

Percentage of reachable functions covered

78.06%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/community.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	58
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/matrix.pmt	13
/src/igraph/src/community/label_propagation.c	3
/src/igraph/src/graph/adjlist.c	10
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	8
/src/igraph/src/community/walktrap/walktrap.cpp	1
/src/igraph/src/community/walktrap/walktrap_graph.cpp	8
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/community/walktrap/walktrap_communities.cpp	17
/src/igraph/src/community/walktrap/walktrap_heap.cpp	9
/src/igraph/src/community/community_misc.c	9
/src/igraph/src/community/edge_betweenness.c	5
/src/igraph/src/core/indheap.c	16
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/math/utils.c	1
/src/igraph/src/community/modularity.c	3
/src/igraph/src/core/sparsemat.c	24
/src/igraph/vendor/cs/cs_util.c	4
/src/igraph/vendor/cs/cs_malloc.c	4
/src/igraph/vendor/cs/cs_entry.c	1
/src/igraph/vendor/cs/cs_compress.c	1
/src/igraph/vendor/cs/cs_cumsum.c	1
/src/igraph/vendor/cs/cs_dupl.c	1
/src/igraph/src/operators/contract.c	1
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/misc/mixing.c	1
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/community/voronoi.c	9
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/paths/voronoi.c	3
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/community/fast_modularity.c	12
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/community/leiden.c	8
/src/igraph/src/community/louvain.c	9
/src/igraph/src/community/fluid.c	1

Fuzzer: misc_algos

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	627	30.3%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	2	0.09%
lawngreen	50+	1435	69.5%
All colors	2064	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
523	523	1 : View List ['igraph_i_ecc3_2']	523	523	igraph_ecc	call site: 01004	/src/igraph/src/properties/ecc.c:372
259	259	1 : View List ['igraph_i_random_walk_adjlist']	259	259	igraph_random_walk	call site: 01433	/src/igraph/src/paths/random_walk.c:341
175	193	5 : View List ['IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	281	igraph_to_undirected	call site: 01982	/src/igraph/src/misc/conversion.c:627
81	93	3 : View List ['igraph_error', 'igraph_vector_size', 'igraph_vector_min']	340	617	igraph_random_walk	call site: 01428	/src/igraph/src/paths/random_walk.c:323
42	93	4 : View List ['igraph_vector_int_init', 'IGRAPH_FINALLY_REAL', 'igraph_i_attribute_permute_edges', 'igraph_error']	42	332	igraph_delete_edges	call site: 01849	/src/igraph/src/graph/type_indexededgelist.c:552
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00078	/src/igraph/src/graph/attributes.c:618
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01623	/src/igraph/src/graph/attributes.c:637
33	385	4 : View List ['igraph_es_all', 'igraph_eit_destroy', 'igraph_eit_create', 'igraph_es_destroy']	180	1003	igraph_to_undirected	call site: 01928	/src/igraph/src/misc/conversion.c:502
24	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	24	149	igraph_add_vertices	call site: 00106	/src/igraph/src/graph/type_indexededgelist.c:420
24	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	24	286	igraph_add_edges	call site: 00207	/src/igraph/src/graph/type_indexededgelist.c:318
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00150	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00087	/src/igraph/src/graph/type_indexededgelist.c:400

Runtime coverage analysis

Covered functions

212

Functions that are reachable but not covered

53

Reachable functions

262

Percentage of reachable functions covered

79.77%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/misc_algos.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	39
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	18
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	2
/src/igraph/src/core/typed_list.pmt	28
/src/igraph/src/misc/cycle_bases.c	6
/src/igraph/src/graph/iterators.c	20
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/core/bitset.c	7
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/misc/order_cycle.cpp	1
/src/igraph/src/misc/motifs.c	3
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/properties/triangles.c	2
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/connectivity/reachability.c	3
/src/igraph/src/core/bitset_list.c	2
/src/igraph/src/paths/simple_paths.c	1
/src/igraph/src/paths/random_walk.c	4
/src/igraph/src/core/vector_ptr.c	6
/src/igraph/src/operators/subgraph.c	7
/src/igraph/src/operators/reverse.c	1
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/core/fixed_vectorlist.c	2

Fuzzer: write_all_graphml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	3024	56.6%
gold	[1:9]	49	0.91%
yellow	[10:29]	61	1.14%
greenyellow	[30:49]	14	0.26%
lawngreen	50+	2190	41.0%
All colors	5338	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
42	270	9 : View List ['igraph_degree_1', 'IGRAPH_FINALLY_REAL', 'igraph_strvector_init', 'igraph_strvector_destroy', 'check_name', 'igraph_strvector_get', 'igraph_i_attribute_get_string_vertex_attr', 'igraph_vss_1', 'igraph_error']	42	331	igraph_write_graph_lgl	call site: 04920	/src/igraph/src/io/lgl.c:429
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00009	/src/igraph/src/core/error.c:212
6	6	3 : View List ['ctime', 'strlen', 'time']	28	3187	igraph_write_graph_gml	call site: 03525	/src/igraph/src/io/gml.c:951
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 02833	/src/igraph/src/core/error.c:471
2	665	9 : View List ['igraph_vector_ptr_size', 'igraph_vector_ptr_get', 'igraph_attribute_record_init', 'strcmp', 'igraph_trie_get', 'igraph_vector_ptr_push_back', 'igraph_errorf', 'igraph_trie_check', 'igraph_error']	2	706	igraph_i_graphml_add_attribute_key	call site: 00000	/src/igraph/src/io/graphml.c:688
2	2	1 : View List ['__errno_location']	2	2	igraph_gml_yylex_init_extra	call site: 03833	/src/igraph/build/src/io/parsers/gml-lexer.c:2235
2	2	1 : View List ['__errno_location']	2	2	igraph_lgl_yylex_init_extra	call site: 04956	/src/igraph/build/src/io/parsers/lgl-lexer.c:2169
2	2	1 : View List ['__errno_location']	2	2	igraph_ncol_yylex_init_extra	call site: 05196	/src/igraph/build/src/io/parsers/ncol-lexer.c:2163
0	224	3 : View List ['igraph_strvector_size', 'igraph_trie_get', 'igraph_strvector_get']	14	2216	igraph_read_graph_ncol	call site: 05188	/src/igraph/src/io/ncol.c:129
0	116	2 : View List ['igraph_attribute_record_resize', 'igraph_error']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:161
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:263
0	86	3 : View List ['igraph_vector_bool_size', 'igraph_vector_bool_reserve', 'igraph_error']	0	86	igraph_vector_bool_push_back	call site: 00000	/src/igraph/src/core/vector.pmt:568

Runtime coverage analysis

Covered functions

345

Functions that are reachable but not covered

646

Reachable functions

921

Percentage of reachable functions covered

29.86%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/write_all_graphml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	27
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.14.3/threads.c	9
/src/libxml2-2.14.3/dict.c	21
/src/libxml2-2.14.3/error.c	17
/src/libxml2-2.14.3/xmlmemory.c	1
/src/libxml2-2.14.3/globals.c	21
/src/libxml2-2.14.3/encoding.c	15
/src/libxml2-2.14.3/xpath.c	2
/src/libxml2-2.14.3/xmlIO.c	16
/src/libxml2-2.14.3/catalog.c	33
/src/igraph/src/core/vector.pmt	39
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/trie.c	12
/src/libxml2-2.14.3/parser.c	144
/src/libxml2-2.14.3/parserInternals.c	38
/src/libxml2-2.14.3/SAX2.c	6
/src/libxml2-2.14.3/buf.c	19
/src/libxml2-2.14.3/hash.c	26
/src/libxml2-2.14.3/xmlstring.c	16
/src/libxml2-2.14.3/include/private/memory.h	1
/src/libxml2-2.14.3/tree.c	66
/src/libxml2-2.14.3/HTMLparser.c	2
/usr/include/x86_64-linux-gnu/bits/stdlib-bsearch.h	1
/src/libxml2-2.14.3/valid.c	40
/src/libxml2-2.14.3/list.c	3
/src/libxml2-2.14.3/xmlregexp.c	4
/src/libxml2-2.14.3/entities.c	10
/src/libxml2-2.14.3/chvalid.c	1
/src/libxml2-2.14.3/uri.c	35
/usr/include/x86_64-linux-gnu/sys/stat.h	1
/usr/include/pthread.h	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/../core/typed_list.pmt	13
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/io/leda.c	1
/src/igraph/src/graph/iterators.c	13
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/io/dot.c	3
/src/igraph/src/io/gml.c	15
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/io/gml-tree.c	16
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/io/pajek.c	2
/src/igraph/src/io/lgl.c	4
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/io/ncol.c	4
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1

Fuzzer: read_graphml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2708	78.9%
gold	[1:9]	7	0.20%
yellow	[10:29]	21	0.61%
greenyellow	[30:49]	7	0.20%
lawngreen	50+	689	20.0%
All colors	3432	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00009	/src/igraph/src/core/error.c:212
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 02833	/src/igraph/src/core/error.c:471
2	665	9 : View List ['igraph_vector_ptr_size', 'igraph_vector_ptr_get', 'igraph_attribute_record_init', 'strcmp', 'igraph_trie_get', 'igraph_vector_ptr_push_back', 'igraph_errorf', 'igraph_trie_check', 'igraph_error']	2	706	igraph_i_graphml_add_attribute_key	call site: 00000	/src/igraph/src/io/graphml.c:688
0	116	2 : View List ['igraph_attribute_record_resize', 'igraph_error']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:161
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:263
0	86	3 : View List ['igraph_vector_size', 'igraph_vector_reserve', 'igraph_error']	0	86	igraph_vector_push_back	call site: 00000	/src/igraph/src/core/vector.pmt:568
0	86	3 : View List ['igraph_vector_bool_size', 'igraph_vector_bool_reserve', 'igraph_error']	0	86	igraph_vector_bool_push_back	call site: 00000	/src/igraph/src/core/vector.pmt:568
0	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	0	92	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1711
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 02911	/src/igraph/src/graph/type_indexededgelist.c:424
0	61	2 : View List ['igraph_strvector_resize', 'igraph_error']	0	61	igraph_strvector_append	call site: 02828	/src/igraph/src/core/strvector.c:333
0	56	1 : View List ['igraph_strvector_append']	0	77	igraph_i_cattribute_get_string_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1773
0	43	1 : View List ['igraph_vector_append']	0	64	igraph_i_cattribute_get_numeric_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1649

Runtime coverage analysis

Covered functions

214

Functions that are reachable but not covered

614

Reachable functions

746

Percentage of reachable functions covered

17.69%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_graphml.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.14.3/threads.c	9
/src/libxml2-2.14.3/dict.c	21
/src/libxml2-2.14.3/error.c	17
/src/libxml2-2.14.3/xmlmemory.c	1
/src/libxml2-2.14.3/globals.c	21
/src/libxml2-2.14.3/encoding.c	15
/src/libxml2-2.14.3/xpath.c	2
/src/libxml2-2.14.3/xmlIO.c	16
/src/libxml2-2.14.3/catalog.c	33
/src/igraph/src/core/vector.pmt	27
/src/igraph/src/core/vector_ptr.c	7
/src/igraph/src/core/strvector.c	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/trie.c	7
/src/libxml2-2.14.3/parser.c	144
/src/libxml2-2.14.3/parserInternals.c	38
/src/libxml2-2.14.3/SAX2.c	6
/src/libxml2-2.14.3/buf.c	19
/src/libxml2-2.14.3/hash.c	26
/src/libxml2-2.14.3/xmlstring.c	16
/src/libxml2-2.14.3/include/private/memory.h	1
/src/libxml2-2.14.3/tree.c	66
/src/libxml2-2.14.3/HTMLparser.c	2
/usr/include/x86_64-linux-gnu/bits/stdlib-bsearch.h	1
/src/libxml2-2.14.3/valid.c	40
/src/libxml2-2.14.3/list.c	3
/src/libxml2-2.14.3/xmlregexp.c	4
/src/libxml2-2.14.3/entities.c	10
/src/libxml2-2.14.3/chvalid.c	1
/src/libxml2-2.14.3/uri.c	35
/usr/include/x86_64-linux-gnu/sys/stat.h	1
/usr/include/pthread.h	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/../core/typed_list.pmt	11
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/printing.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/graph/type_common.c	1

Fuzzer: centrality

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2446	65.2%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	2	0.05%
lawngreen	50+	1300	34.6%
All colors	3748	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
3332	3332	2 : View List ['igraph_i_personalized_pagerank_arpack', 'igraph_arpack_options_get_default']	3332	3332	igraph_personalized_pagerank	call site: 01640	/src/igraph/src/centrality/pagerank.c:459
660	928	7 : View List ['IGRAPH_FINALLY_REAL', 'igraph_vit_create', 'IGRAPH_FINALLY_CLEAN', 'transitivity_local_undirected2', 'igraph_vit_destroy', 'transitivity_local_undirected1', 'igraph_error']	660	928	igraph_transitivity_local_undirected	call site: 01444	/src/igraph/src/properties/triangles.c:378
408	408	1 : View List ['igraph_i_closeness_cutoff_weighted']	408	408	igraph_closeness_cutoff	call site: 01055	/src/igraph/src/centrality/closeness.c:345
405	405	1 : View List ['igraph_i_harmonic_centrality_weighted']	405	405	igraph_harmonic_centrality_cutoff	call site: 01167	/src/igraph/src/centrality/closeness.c:727
291	291	1 : View List ['adjacent_triangles1']	291	291	igraph_count_adjacent_triangles	call site: 01634	/src/igraph/src/properties/triangles.c:528
251	251	1 : View List ['igraph_i_average_path_length_dijkstra']	251	251	igraph_global_efficiency	call site: 01261	/src/igraph/src/paths/shortest_paths.c:396
175	206	6 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	301	igraph_simplify	call site: 03602	/src/igraph/src/operators/simplify.c:176
175	193	5 : View List ['IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	281	igraph_to_undirected	call site: 03434	/src/igraph/src/misc/conversion.c:627
88	100	4 : View List ['igraph_error', 'igraph_warning', 'igraph_vector_size', 'igraph_vector_min']	88	100	igraph_i_betweenness_check_weights	call site: 00232	/src/igraph/src/centrality/betweenness.c:430
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 00506	/src/igraph/src/core/stack.pmt:212
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00078	/src/igraph/src/graph/attributes.c:618
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 03396	/src/igraph/src/graph/attributes.c:637

Runtime coverage analysis

Covered functions

177

Functions that are reachable but not covered

306

Reachable functions

517

Percentage of reachable functions covered

40.81%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/centrality.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/core/vector.pmt	49
/src/igraph/src/random/random.c	6
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	15
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	8
/src/igraph/src/core/vector.c	2
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/centrality/betweenness.c	9
/src/igraph/src/graph/adjlist.c	17
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/stack.pmt	8
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/indheap.c	16
/src/igraph/src/math/utils.c	1
/src/igraph/src/core/dqueue.pmt	6
/src/igraph/src/centrality/closeness.c	5
/src/igraph/src/paths/shortest_paths.c	6
/src/igraph/src/properties/triangles.c	12
/src/igraph/src/centrality/pagerank.c	5
/src/igraph/src/linalg/arpack.c	10
/src/igraph/src/core/matrix.pmt	5
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/math/complex.c	6
/src/igraph/vendor/lapack/dnaupd.c	1
/src/igraph/vendor/lapack/arscnd.c	1
/src/igraph/vendor/f2c/s_cmp.c	1
/src/igraph/vendor/lapack/dlamch.c	1
/src/igraph/vendor/lapack/fortran_intrinsics.c	7
/src/igraph/vendor/lapack/lsame.c	1
/src/igraph/vendor/lapack/dnaup2.c	1
/src/igraph/vendor/f2c/pow_dd.c	1
/src/igraph/vendor/lapack/dgetv0.c	1
/src/igraph/vendor/lapack/dlarnv.c	1
/src/igraph/vendor/lapack/dlaruv.c	1
/src/igraph/vendor/lapack/dcopy.c	1
/src/igraph/vendor/lapack/ddot.c	1
/src/igraph/vendor/lapack/dnrm2.c	1
/src/igraph/vendor/lapack/dgemv.c	1
/src/igraph/vendor/lapack/xerbla.c	1
/src/igraph/vendor/f2c/wsfe.c	1
/src/igraph/vendor/f2c/err.c	5
/src/igraph/vendor/f2c/sfe.c	2
/src/igraph/vendor/f2c/sig_die.c	1
/src/igraph/vendor/f2c/close.c	2
/src/igraph/vendor/f2c/endfile.c	1
/src/igraph/vendor/f2c/open.c	4
/src/igraph/vendor/f2c/util.c	2
/src/igraph/vendor/f2c/fmt.c	13
/src/igraph/vendor/lapack/len_trim.c	1
/src/igraph/vendor/f2c/i_len.c	1
/src/igraph/vendor/f2c/s_stop.c	1
/src/igraph/vendor/lapack/dvout.c	1
/src/igraph/vendor/lapack/dnaitr.c	1
/src/igraph/vendor/lapack/dlabad.c	1
/src/igraph/vendor/f2c/d_lg10.c	1
/src/igraph/vendor/lapack/ivout.c	1
/src/igraph/vendor/lapack/dscal.c	1
/src/igraph/vendor/lapack/dlascl.c	1
/src/igraph/vendor/lapack/disnan.c	1
/src/igraph/vendor/lapack/dlaisnan.c	1
/src/igraph/vendor/lapack/daxpy.c	1
/src/igraph/vendor/lapack/dlanhs.c	1
/src/igraph/vendor/lapack/dlassq.c	1
/src/igraph/vendor/lapack/dmout.c	1
/src/igraph/vendor/lapack/dneigh.c	1
/src/igraph/vendor/lapack/dlacpy.c	1
/src/igraph/vendor/lapack/dlahqr.c	1
/src/igraph/vendor/lapack/dlarfg.c	1
/src/igraph/vendor/lapack/dlapy2.c	1
/src/igraph/vendor/f2c/d_sign.c	1
/src/igraph/vendor/lapack/dlanv2.c	1
/src/igraph/vendor/lapack/drot.c	1
/src/igraph/vendor/lapack/dtrevc.c	1
/src/igraph/vendor/lapack/dlaln2.c	1
/src/igraph/vendor/lapack/dladiv.c	3
/src/igraph/vendor/lapack/idamax.c	1
/src/igraph/vendor/lapack/dngets.c	1
/src/igraph/vendor/lapack/dsortc.c	1
/src/igraph/vendor/lapack/dnconv.c	1
/src/igraph/vendor/f2c/s_copy.c	1
/src/igraph/vendor/lapack/dnapps.c	1
/src/igraph/vendor/lapack/dlaset.c	1
/src/igraph/vendor/lapack/dlartg.c	1
/src/igraph/vendor/f2c/pow_di.c	1
/src/igraph/vendor/lapack/dlarf.c	1
/src/igraph/vendor/lapack/iladlc.c	1
/src/igraph/vendor/lapack/iladlr.c	1
/src/igraph/vendor/lapack/dger.c	1
/src/igraph/vendor/lapack/dneupd.c	1
/src/igraph/vendor/lapack/dtrsen.c	1
/src/igraph/vendor/lapack/dlange.c	1
/src/igraph/vendor/lapack/dtrexc.c	1
/src/igraph/vendor/lapack/dlaexc.c	1
/src/igraph/vendor/lapack/dlasy2.c	1
/src/igraph/vendor/lapack/dswap.c	1
/src/igraph/vendor/lapack/dlarfx.c	1
/src/igraph/vendor/lapack/dtrsyl.c	1
/src/igraph/vendor/lapack/dlacn2.c	1
/src/igraph/vendor/lapack/dasum.c	1
/src/igraph/vendor/f2c/i_dnnt.c	1
/src/igraph/vendor/lapack/dgeqr2.c	1
/src/igraph/vendor/lapack/dorm2r.c	1
/src/igraph/vendor/lapack/dtrmm.c	1
/src/igraph/src/centrality/prpack.cpp	1
/src/igraph/src/centrality/prpack/prpack_igraph_graph.h	2
/src/igraph/src/centrality/prpack/prpack_base_graph.cpp	4
/src/igraph/src/centrality/prpack/prpack_igraph_graph.cpp	1
/src/igraph/src/centrality/prpack/prpack_solver.cpp	15
/src/igraph/src/centrality/prpack/prpack_utils.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_ge_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_result.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_gs_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_schur_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_scc_graph.cpp	5
/usr/local/bin/../include/c++/v1/stdexcept	1
/src/igraph/src/properties/constraint.c	1
/src/igraph/src/paths/sparsifier.c	3
/src/igraph/src/core/bitset.c	4
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/centrality/truss.cpp	4
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/loops.c	1

Fuzzer: edge_connectivity

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	643	46.5%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	738	53.4%
All colors	1381	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
736	1927	23 : View List ['igraph_vector_int_tail', 'igraph_buckets_empty', 'igraph_vector_int_empty', 'igraph_dqueue_int_pop', 'igraph_vector_int_init', 'igraph_vector_init', 'igraph_is_dag', 'igraph_dqueue_int_push', 'igraph_vector_int_size', 'igraph_error', 'igraph_dqueue_int_empty', 'IGRAPH_FINALLY_REAL', 'igraph_destroy', 'igraph_dqueue_int_init', 'igraph_vector_int_null', 'igraph_buckets_clear', 'igraph_vector_resize', 'igraph_vector_int_pop_back', 'igraph_create', 'igraph_vector_int_push_back', 'igraph_buckets_popmax', 'igraph_vector_int_clear', 'igraph_buckets_add']	736	2258	igraph_maxflow	call site: 00744	/src/igraph/src/flow/flow.c:751
175	193	5 : View List ['IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	175	281	igraph_to_undirected	call site: 01286	/src/igraph/src/misc/conversion.c:627
137	405	11 : View List ['igraph_vector_int_destroy', 'igraph_bitset_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_bitset_init', 'IGRAPH_FINALLY_CLEAN', 'igraph_edge', 'igraph_vector_int_resize', 'igraph_vector_int_push_back', 'igraph_vector_int_append', 'igraph_vector_int_clear', 'igraph_error']	137	405	igraph_i_mincut_undirected	call site: 00716	/src/igraph/src/flow/flow.c:1393
43	113	3 : View List ['igraph_vector_bool_init', 'igraph_vector_int_resize', 'igraph_vector_bool_destroy']	926	2787	igraph_maxflow	call site: 00744	/src/igraph/src/flow/flow.c:681
42	86	3 : View List ['igraph_vector_int_reserve', 'igraph_vector_int_size', 'igraph_error']	42	86	igraph_vector_int_push_back	call site: 00155	/src/igraph/src/core/vector.pmt:568
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:618
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01248	/src/igraph/src/graph/attributes.c:637
33	385	4 : View List ['igraph_es_all', 'igraph_eit_destroy', 'igraph_eit_create', 'igraph_es_destroy']	180	1003	igraph_to_undirected	call site: 01224	/src/igraph/src/misc/conversion.c:502
24	123	5 : View List ['IGRAPH_FINALLY_ENTER', 'IGRAPH_FINALLY_EXIT', 'igraph_i_attribute_add_vertices', 'igraph_vector_int_resize', 'igraph_error']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:420
24	94	3 : View List ['igraph_error', 'igraph_vector_int_resize', 'igraph_i_attribute_add_edges']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:318
23	23	2 : View List ['realloc', 'igraph_error']	23	23	igraph_vector_reserve	call site: 00706	/src/igraph/src/core/vector.pmt:469
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:272

Runtime coverage analysis

Covered functions

126

Functions that are reachable but not covered

46

Reachable functions

172

Percentage of reachable functions covered

73.26%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/edge_connectivity.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	29
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	13
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	7
/src/igraph/src/core/vector.c	2
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	5
/src/igraph/src/graph/iterators.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/cutheap.c	11
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8

Fuzzer: write_all_gml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	3063	57.3%
gold	[1:9]	24	0.44%
yellow	[10:29]	2	0.03%
greenyellow	[30:49]	10	0.18%
lawngreen	50+	2239	41.9%
All colors	5338	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
844	844	1 : View List ['xmlFreeDoc']	848	1449	igraph_read_graph_graphml	call site: 04743	/src/igraph/src/io/graphml.c:1558
45	66	2 : View List ['igraph_i_graphml_handle_unknown_start_tag', 'igraph_error']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:986
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1020
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1141
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1153
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1165
42	270	9 : View List ['igraph_degree_1', 'IGRAPH_FINALLY_REAL', 'igraph_strvector_init', 'igraph_strvector_destroy', 'check_name', 'igraph_strvector_get', 'igraph_i_attribute_get_string_vertex_attr', 'igraph_vss_1', 'igraph_error']	42	331	igraph_write_graph_lgl	call site: 04920	/src/igraph/src/io/lgl.c:429
30	133	4 : View List ['igraph_vector_bool_init', 'igraph_vector_int_init', 'igraph_vector_bool_destroy', 'igraph_i_attribute_get_bool_vertex_attr']	42	2324	igraph_write_graph_pajek	call site: 01801	/src/igraph/src/io/pajek.c:487
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00010	/src/igraph/src/core/error.c:212
15	111	5 : View List ['igraph_i_attribute_get_bool_edge_attr', 'igraph_ess_all', 'IGRAPH_FINALLY_REAL', 'igraph_vector_bool_init', 'igraph_vector_bool_destroy']	15	338	igraph_write_graph_leda	call site: 01303	/src/igraph/src/io/leda.c:264
15	17	2 : View List ['igraph_vss_all', 'igraph_i_attribute_get_bool_vertex_attr']	32	1348	igraph_write_graph_leda	call site: 01255	/src/igraph/src/io/leda.c:192
6	6	3 : View List ['ctime', 'strlen', 'time']	73	3187	igraph_write_graph_gml	call site: 01486	/src/igraph/src/io/gml.c:951

Runtime coverage analysis

Covered functions

330

Functions that are reachable but not covered

646

Reachable functions

921

Percentage of reachable functions covered

29.86%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/write_all_gml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	27
/src/igraph/src/io/gml.c	15
/src/igraph/src/io/gml-tree.c	16
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/core/vector.pmt	39
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	13
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/trie.c	12
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/io/leda.c	1
/src/igraph/src/graph/iterators.c	13
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/io/dot.c	3
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/io/pajek.c	2
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.14.3/threads.c	9
/src/libxml2-2.14.3/dict.c	21
/src/libxml2-2.14.3/error.c	17
/src/libxml2-2.14.3/xmlmemory.c	1
/src/libxml2-2.14.3/globals.c	21
/src/libxml2-2.14.3/encoding.c	15
/src/libxml2-2.14.3/xpath.c	2
/src/libxml2-2.14.3/xmlIO.c	16
/src/libxml2-2.14.3/catalog.c	33
/src/libxml2-2.14.3/parser.c	144
/src/libxml2-2.14.3/parserInternals.c	38
/src/libxml2-2.14.3/SAX2.c	6
/src/libxml2-2.14.3/buf.c	19
/src/libxml2-2.14.3/hash.c	26
/src/libxml2-2.14.3/xmlstring.c	16
/src/libxml2-2.14.3/include/private/memory.h	1
/src/libxml2-2.14.3/tree.c	66
/src/libxml2-2.14.3/HTMLparser.c	2
/usr/include/x86_64-linux-gnu/bits/stdlib-bsearch.h	1
/src/libxml2-2.14.3/valid.c	40
/src/libxml2-2.14.3/list.c	3
/src/libxml2-2.14.3/xmlregexp.c	4
/src/libxml2-2.14.3/entities.c	10
/src/libxml2-2.14.3/chvalid.c	1
/src/libxml2-2.14.3/uri.c	35
/usr/include/x86_64-linux-gnu/sys/stat.h	1
/usr/include/pthread.h	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/io/lgl.c	4
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/io/ncol.c	4
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1

Fuzzer: linear_algos_undirected

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1115	32.1%
gold	[1:9]	5	0.14%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	2349	67.7%
All colors	3469	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
977	977	2 : View List ['igraph_i_eulerian_path_directed', 'igraph_i_is_eulerian_directed']	977	1040	igraph_eulerian_cycle	call site: 02320	/src/igraph/src/paths/eulerian.c:601
977	977	2 : View List ['igraph_i_eulerian_path_directed', 'igraph_i_is_eulerian_directed']	977	1040	igraph_eulerian_path	call site: 02179	/src/igraph/src/paths/eulerian.c:663
553	553	1 : View List ['igraph_i_is_eulerian_directed']	553	574	igraph_is_eulerian	call site: 02072	/src/igraph/src/paths/eulerian.c:336
478	492	2 : View List ['igraph_i_connected_components_strong', 'igraph_ecount']	478	513	igraph_is_connected	call site: 00702	/src/igraph/src/connectivity/components.c:464
471	471	1 : View List ['igraph_i_realize_directed_degree_sequence(igraph_t*, igraph_vector_int_t const*, igraph_vector_int_t const*, unsigned int, igraph_realize_degseq_t)']	471	471	igraph_realize_degree_sequence	call site: 01348	/src/igraph/src/misc/degree_sequence.cpp:801
329	329	1 : View List ['igraph_i_pseudo_diameter_dijkstra']	329	329	igraph_pseudo_diameter	call site: 01616	/src/igraph/src/paths/distances.c:797
172	217	6 : View List ['igraph_error', 'igraph_i_is_graphical_directed_simple', 'igraph_i_is_graphical_directed_loopy_multi', 'igraph_i_is_graphical_directed_loopless_multi', 'igraph_i_is_graphical_directed_loopy_simple', 'igraph_vector_int_size']	172	217	igraph_is_graphical	call site: 01263	/src/igraph/src/misc/graphicality.c:117
133	206	6 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	133	301	igraph_simplify	call site: 03261	/src/igraph/src/operators/simplify.c:176
43	43	1 : View List ['igraph_vector_int_append']	43	271	igraph_i_eit_create_allfromto	call site: 01027	/src/igraph/src/graph/iterators.c:1699
26	65	4 : View List ['igraph_rng_default', 'time', 'igraph_rng_seed', 'igraph_rng_get_integer']	32	2609	igraph_i_pseudo_diameter_unweighted	call site: 01744	/src/igraph/src/paths/distances.c:398
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:272
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:400

Runtime coverage analysis

Covered functions

302

Functions that are reachable but not covered

89

Reachable functions

395

Percentage of reachable functions covered

77.47%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/linear_algos_undirected.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/core/vector.pmt	57
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	4
/src/igraph/src/graph/type_indexededgelist.c	18
/src/igraph/src/core/memory.c	2
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	2
/src/igraph/src/core/typed_list.pmt	14
/src/igraph/src/core/matrix.pmt	4
/src/igraph/src/misc/feedback_arc_set.c	2
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/connectivity/components.c	11
/src/igraph/src/core/bitset.c	3
/src/igraph/src/graph/adjlist.c	15
/src/igraph/src/graph/iterators.c	21
/src/igraph/src/core/interruption.c	1
/src/igraph/src/misc/chordality.c	1
/src/igraph/src/centrality/coreness.c	1
/src/igraph/src/properties/girth.c	1
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/core/progress.c	1
/src/igraph/src/misc/mixing.c	2
/src/igraph/src/properties/degrees.c	3
/src/igraph/src/properties/multiplicity.c	4
/src/igraph/src/properties/loops.c	3
/src/igraph/src/properties/basic_properties.c	1
/src/igraph/src/misc/graphicality.c	11
/src/igraph/src/misc/degree_sequence.cpp	12
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/paths/unweighted.c	3
/src/igraph/src/paths/distances.c	5
/src/igraph/src/random/random.c	12
/src/igraph/src/core/indheap.c	27
/src/igraph/src/graph/visitors.c	3
/src/igraph/src/paths/eulerian.c	7
/src/igraph/src/misc/coloring.c	7
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/core/genheap.c	14
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/operators/subgraph.c	5
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/properties/trees.c	3
/src/igraph/src/constructors/prufer.c	1
/src/igraph/src/graph/../core/typed_list.pmt	10
/src/igraph/src/graph/graph_list.c	2
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/all_shortest_paths.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/operators/rewire.c	2
/src/igraph/src/graph/basic_query.c	1

Fuzzer: weighted_centrality

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2500	65.2%
gold	[1:9]	1	0.02%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1331	34.7%
All colors	3832	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
3332	3332	2 : View List ['igraph_i_personalized_pagerank_arpack', 'igraph_arpack_options_get_default']	3332	3332	igraph_personalized_pagerank	call site: 01430	/src/igraph/src/centrality/pagerank.c:459
896	1380	21 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_CLEAN', 'igraph_dqueue_int_pop', 'igraph_progress', 'igraph_vector_int_init', 'igraph_vit_destroy', 'igraph_vector_int_resize', 'igraph_adjlist_destroy', 'igraph_allow_interruption', 'igraph_dqueue_int_push', 'igraph_vector_int_size', 'igraph_error', 'igraph_adjlist_init', 'igraph_dqueue_int_empty', 'IGRAPH_FINALLY_REAL', 'igraph_vit_create', 'igraph_dqueue_int_init', 'igraph_vector_null', 'igraph_vector_resize', 'igraph_dqueue_int_destroy', 'igraph_dqueue_int_clear']	896	1380	igraph_closeness_cutoff	call site: 01057	/src/igraph/src/centrality/closeness.c:345
457	457	1 : View List ['igraph_i_harmonic_centrality_unweighted']	457	457	igraph_harmonic_centrality_cutoff	call site: 01169	/src/igraph/src/centrality/closeness.c:727
432	432	1 : View List ['transitivity_barrat1']	432	432	igraph_transitivity_barrat	call site: 03744	/src/igraph/src/properties/triangles.c:940
430	430	1 : View List ['igraph_i_average_path_length_unweighted']	430	430	igraph_global_efficiency	call site: 01263	/src/igraph/src/paths/shortest_paths.c:396
374	374	1 : View List ['igraph_adjlist_init']	833	2364	igraph_betweenness_subset	call site: 00741	/src/igraph/src/centrality/betweenness.c:935
374	374	1 : View List ['igraph_adjlist_init']	789	1769	igraph_betweenness_cutoff	call site: 00244	/src/igraph/src/centrality/betweenness.c:568
105	605	12 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_vit_create', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_null', 'igraph_vector_resize', 'igraph_vector_int_init', 'igraph_vector_int_reserve', 'igraph_vit_destroy', 'igraph_error', 'igraph_incident', 'igraph_vector_int_size']	105	605	igraph_strength	call site: 01515	/src/igraph/src/properties/degrees.c:649
105	105	1 : View List ['igraph_error']	105	105	igraph_attribute_record_check_type	call site: 03059	/src/igraph/src/graph/attributes.c:263
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 00508	/src/igraph/src/core/stack.pmt:212
74	86	3 : View List ['igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size', 'igraph_error']	74	86	igraph_i_attribute_record_list_expand_if_full	call site: 03068	/src/igraph/src/graph/../core/typed_list.pmt:1098
53	65	3 : View List ['igraph_vector_ptr_reserve', 'igraph_vector_ptr_size', 'igraph_error']	53	65	igraph_vector_ptr_push_back	call site: 03197	/src/igraph/src/core/vector_ptr.c:365

Runtime coverage analysis

Covered functions

229

Functions that are reachable but not covered

301

Reachable functions

542

Percentage of reachable functions covered

44.46%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/weighted_centrality.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/core/vector.pmt	47
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/random/random.c	6
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	14
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/core/vector.c	2
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/centrality/betweenness.c	9
/src/igraph/src/graph/adjlist.c	15
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/stack.pmt	8
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/indheap.c	16
/src/igraph/src/math/utils.c	1
/src/igraph/src/core/dqueue.pmt	6
/src/igraph/src/centrality/closeness.c	5
/src/igraph/src/paths/shortest_paths.c	6
/src/igraph/src/centrality/pagerank.c	5
/src/igraph/src/linalg/arpack.c	10
/src/igraph/src/core/matrix.pmt	5
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/math/complex.c	6
/src/igraph/vendor/lapack/dnaupd.c	1
/src/igraph/vendor/lapack/arscnd.c	1
/src/igraph/vendor/f2c/s_cmp.c	1
/src/igraph/vendor/lapack/dlamch.c	1
/src/igraph/vendor/lapack/fortran_intrinsics.c	7
/src/igraph/vendor/lapack/lsame.c	1
/src/igraph/vendor/lapack/dnaup2.c	1
/src/igraph/vendor/f2c/pow_dd.c	1
/src/igraph/vendor/lapack/dgetv0.c	1
/src/igraph/vendor/lapack/dlarnv.c	1
/src/igraph/vendor/lapack/dlaruv.c	1
/src/igraph/vendor/lapack/dcopy.c	1
/src/igraph/vendor/lapack/ddot.c	1
/src/igraph/vendor/lapack/dnrm2.c	1
/src/igraph/vendor/lapack/dgemv.c	1
/src/igraph/vendor/lapack/xerbla.c	1
/src/igraph/vendor/f2c/wsfe.c	1
/src/igraph/vendor/f2c/err.c	5
/src/igraph/vendor/f2c/sfe.c	2
/src/igraph/vendor/f2c/sig_die.c	1
/src/igraph/vendor/f2c/close.c	2
/src/igraph/vendor/f2c/endfile.c	1
/src/igraph/vendor/f2c/open.c	4
/src/igraph/vendor/f2c/util.c	2
/src/igraph/vendor/f2c/fmt.c	13
/src/igraph/vendor/lapack/len_trim.c	1
/src/igraph/vendor/f2c/i_len.c	1
/src/igraph/vendor/f2c/s_stop.c	1
/src/igraph/vendor/lapack/dvout.c	1
/src/igraph/vendor/lapack/dnaitr.c	1
/src/igraph/vendor/lapack/dlabad.c	1
/src/igraph/vendor/f2c/d_lg10.c	1
/src/igraph/vendor/lapack/ivout.c	1
/src/igraph/vendor/lapack/dscal.c	1
/src/igraph/vendor/lapack/dlascl.c	1
/src/igraph/vendor/lapack/disnan.c	1
/src/igraph/vendor/lapack/dlaisnan.c	1
/src/igraph/vendor/lapack/daxpy.c	1
/src/igraph/vendor/lapack/dlanhs.c	1
/src/igraph/vendor/lapack/dlassq.c	1
/src/igraph/vendor/lapack/dmout.c	1
/src/igraph/vendor/lapack/dneigh.c	1
/src/igraph/vendor/lapack/dlacpy.c	1
/src/igraph/vendor/lapack/dlahqr.c	1
/src/igraph/vendor/lapack/dlarfg.c	1
/src/igraph/vendor/lapack/dlapy2.c	1
/src/igraph/vendor/f2c/d_sign.c	1
/src/igraph/vendor/lapack/dlanv2.c	1
/src/igraph/vendor/lapack/drot.c	1
/src/igraph/vendor/lapack/dtrevc.c	1
/src/igraph/vendor/lapack/dlaln2.c	1
/src/igraph/vendor/lapack/dladiv.c	3
/src/igraph/vendor/lapack/idamax.c	1
/src/igraph/vendor/lapack/dngets.c	1
/src/igraph/vendor/lapack/dsortc.c	1
/src/igraph/vendor/lapack/dnconv.c	1
/src/igraph/vendor/f2c/s_copy.c	1
/src/igraph/vendor/lapack/dnapps.c	1
/src/igraph/vendor/lapack/dlaset.c	1
/src/igraph/vendor/lapack/dlartg.c	1
/src/igraph/vendor/f2c/pow_di.c	1
/src/igraph/vendor/lapack/dlarf.c	1
/src/igraph/vendor/lapack/iladlc.c	1
/src/igraph/vendor/lapack/iladlr.c	1
/src/igraph/vendor/lapack/dger.c	1
/src/igraph/vendor/lapack/dneupd.c	1
/src/igraph/vendor/lapack/dtrsen.c	1
/src/igraph/vendor/lapack/dlange.c	1
/src/igraph/vendor/lapack/dtrexc.c	1
/src/igraph/vendor/lapack/dlaexc.c	1
/src/igraph/vendor/lapack/dlasy2.c	1
/src/igraph/vendor/lapack/dswap.c	1
/src/igraph/vendor/lapack/dlarfx.c	1
/src/igraph/vendor/lapack/dtrsyl.c	1
/src/igraph/vendor/lapack/dlacn2.c	1
/src/igraph/vendor/lapack/dasum.c	1
/src/igraph/vendor/f2c/i_dnnt.c	1
/src/igraph/vendor/lapack/dgeqr2.c	1
/src/igraph/vendor/lapack/dorm2r.c	1
/src/igraph/vendor/lapack/dtrmm.c	1
/src/igraph/src/centrality/prpack.cpp	1
/src/igraph/src/centrality/prpack/prpack_igraph_graph.h	2
/src/igraph/src/centrality/prpack/prpack_base_graph.cpp	4
/src/igraph/src/centrality/prpack/prpack_igraph_graph.cpp	1
/src/igraph/src/centrality/prpack/prpack_solver.cpp	15
/src/igraph/src/centrality/prpack/prpack_utils.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_ge_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_result.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_gs_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_schur_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_scc_graph.cpp	5
/usr/local/bin/../include/c++/v1/stdexcept	1
/src/igraph/src/properties/constraint.c	1
/src/igraph/src/graph/cattributes.c	8
/src/igraph/src/graph/../core/typed_list.pmt	7
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/properties/basic_properties.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/triangles.c	8
/src/igraph/src/properties/loops.c	1

Fuzzer: linear_algos_directed

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	4269	65.3%
gold	[1:9]	2	0.03%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	55	0.84%
lawngreen	50+	2204	33.7%
All colors	6530	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
975	975	2 : View List ['igraph_i_is_eulerian_undirected', 'igraph_i_eulerian_path_undirected']	975	1038	igraph_eulerian_cycle	call site: 05828	/src/igraph/src/paths/eulerian.c:601
975	975	2 : View List ['igraph_i_is_eulerian_undirected', 'igraph_i_eulerian_path_undirected']	975	1038	igraph_eulerian_path	call site: 05681	/src/igraph/src/paths/eulerian.c:663
573	573	1 : View List ['igraph_i_realize_undirected_degree_sequence(igraph_t*, igraph_vector_int_t const*, unsigned int, igraph_realize_degseq_t)']	573	573	igraph_realize_degree_sequence	call site: 01138	/src/igraph/src/misc/degree_sequence.cpp:801
550	550	1 : View List ['igraph_i_is_eulerian_undirected']	550	571	igraph_is_eulerian	call site: 05609	/src/igraph/src/paths/eulerian.c:336
329	329	1 : View List ['igraph_i_pseudo_diameter_dijkstra']	329	329	igraph_pseudo_diameter	call site: 01432	/src/igraph/src/paths/distances.c:797
159	159	4 : View List ['igraph_i_is_graphical_undirected_loopless_multi', 'igraph_i_is_graphical_undirected_multi_loops', 'igraph_i_is_graphical_undirected_loopy_simple', 'igraph_i_is_graphical_undirected_simple']	159	159	igraph_is_graphical	call site: 01053	/src/igraph/src/misc/graphicality.c:117
133	206	6 : View List ['igraph_vector_int_destroy', 'IGRAPH_FINALLY_REAL', 'igraph_fixed_vectorlist_convert', 'igraph_i_attribute_combine_edges', 'igraph_fixed_vectorlist_destroy', 'igraph_error']	133	301	igraph_simplify	call site: 06313	/src/igraph/src/operators/simplify.c:176
96	442	8 : View List ['igraph_vector_int_sort_ind', 'IGRAPH_FINALLY_REAL', 'igraph_neighbors', 'igraph_vector_int_init', 'igraph_vector_int_resize', 'igraph_error', 'igraph_vector_int_null', 'igraph_vector_int_size']	96	517	igraph_i_feedback_arc_set_eades	call site: 05587	/src/igraph/src/misc/feedback_arc_set.c:715
26	65	4 : View List ['igraph_rng_default', 'time', 'igraph_rng_seed', 'igraph_rng_get_integer']	32	2609	igraph_i_pseudo_diameter_unweighted	call site: 01560	/src/igraph/src/paths/distances.c:398
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00011	/src/igraph/src/core/error.c:212
14	40	3 : View List ['igraph_vector_is_all_finite', 'igraph_vector_size', 'igraph_ecount']	14497	15137	igraph_feedback_arc_set	call site: 02105	/src/igraph/src/misc/feedback_arc_set.c:354
11	11	1 : View List ['igraph_i_rng_get_uint64_bounded']	11	11	igraph_i_rng_get_uint_bounded	call site: 01454	/src/igraph/src/random/random.c:541

Runtime coverage analysis

Covered functions

273

Functions that are reachable but not covered

669

Reachable functions

943

Percentage of reachable functions covered

29.06%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/linear_algos_directed.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/core/vector.pmt	61
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	4
/src/igraph/src/graph/type_indexededgelist.c	19
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	14
/src/igraph/src/core/matrix.pmt	4
/src/igraph/src/misc/feedback_arc_set.c	10
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/connectivity/components.c	7
/src/igraph/src/core/bitset.c	4
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	15
/src/igraph/src/graph/iterators.c	21
/src/igraph/src/core/progress.c	1
/src/igraph/src/centrality/coreness.c	1
/src/igraph/src/misc/mixing.c	2
/src/igraph/src/properties/degrees.c	3
/src/igraph/src/properties/multiplicity.c	5
/src/igraph/src/properties/loops.c	3
/src/igraph/src/properties/basic_properties.c	2
/src/igraph/src/misc/graphicality.c	11
/src/igraph/src/misc/degree_sequence.cpp	14
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/paths/unweighted.c	3
/src/igraph/src/paths/distances.c	5
/src/igraph/src/random/random.c	12
/src/igraph/src/core/indheap.c	26
/src/igraph/src/graph/visitors.c	3
/src/igraph/src/operators/reverse.c	1
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/flow/st-cuts.c	9
/src/igraph/src/properties/trees.c	1
/src/igraph/src/properties/dag.c	2
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/internal/qsort.c	4
/src/igraph/vendor/glpk/env/error.c	4
/src/igraph/vendor/glpk/env/env.c	4
/src/igraph/vendor/glpk/env/tls.c	2
/src/igraph/src/internal/glpk_support.c	4
/src/igraph/vendor/glpk/env/dlsup.c	1
/src/igraph/vendor/glpk/env/stdout.c	4
/src/igraph/vendor/glpk/draft/glpapi09.c	12
/src/igraph/vendor/glpk/api/prob1.c	19
/src/igraph/vendor/glpk/env/alloc.c	5
/src/igraph/vendor/glpk/misc/dmp.c	5
/src/igraph/vendor/glpk/misc/avl.c	6
/src/igraph/vendor/glpk/draft/bfd.c	11
/src/igraph/vendor/glpk/bflib/fhvint.c	7
/src/igraph/vendor/glpk/bflib/lufint.c	3
/src/igraph/vendor/glpk/bflib/sva.c	9
/src/igraph/vendor/glpk/bflib/scfint.c	7
/src/igraph/vendor/glpk/bflib/btfint.c	5
/src/igraph/vendor/glpk/draft/glpapi06.c	14
/src/igraph/vendor/glpk/draft/glpios01.c	21
/src/igraph/vendor/glpk/env/time.c	2
/src/igraph/vendor/glpk/env/stdc.c	1
/src/igraph/vendor/glpk/misc/jd.c	2
/src/igraph/vendor/glpk/draft/glpios03.c	16
/src/igraph/vendor/glpk/draft/glpios12.c	4
/src/igraph/vendor/glpk/api/prob5.c	3
/src/igraph/vendor/glpk/api/prob4.c	5
/src/igraph/vendor/glpk/intopt/mirgen.c	21
/src/igraph/vendor/glpk/intopt/spv.c	8
/src/igraph/vendor/glpk/intopt/covgen.c	14
/src/igraph/vendor/glpk/api/prob2.c	12
/src/igraph/vendor/glpk/misc/fvs.c	6
/src/igraph/vendor/glpk/intopt/cfg2.c	2
/src/igraph/vendor/glpk/intopt/cfg1.c	9
/src/igraph/vendor/glpk/intopt/cfg.c	7
/src/igraph/vendor/glpk/draft/glpios02.c	8
/src/igraph/vendor/glpk/draft/glpapi12.c	13
/src/igraph/vendor/glpk/bflib/luf.c	10
/src/igraph/vendor/glpk/bflib/sgf.c	7
/src/igraph/vendor/glpk/bflib/btf.c	7
/src/igraph/vendor/glpk/misc/mc21a.c	1
/src/igraph/vendor/glpk/misc/mc13d.c	1
/src/igraph/vendor/glpk/simplex/spxprim.c	10
/src/igraph/vendor/glpk/simplex/spxprob.c	7
/src/igraph/vendor/glpk/simplex/spxat.c	6
/src/igraph/vendor/glpk/simplex/spxnt.c	8
/src/igraph/vendor/glpk/simplex/spxchuzc.c	7
/src/igraph/vendor/glpk/simplex/spxlp.c	12
/src/igraph/vendor/glpk/bflib/fhv.c	3
/src/igraph/vendor/glpk/bflib/scf.c	11
/src/igraph/vendor/glpk/bflib/ifu.c	6
/src/igraph/vendor/glpk/simplex/spxchuzr.c	5
/src/igraph/vendor/glpk/simplex/spydual.c	12
/src/igraph/vendor/glpk/simplex/spychuzr.c	7
/src/igraph/vendor/glpk/simplex/spychuzc.c	5
/src/igraph/vendor/glpk/npp/npp1.c	21
/src/igraph/vendor/glpk/npp/npp5.c	7
/src/igraph/vendor/glpk/npp/npp2.c	10
/src/igraph/vendor/glpk/npp/npp3.c	20
/src/igraph/vendor/glpk/draft/glpscl.c	13
/src/igraph/vendor/glpk/misc/round2n.c	1
/src/igraph/vendor/glpk/api/advbas.c	2
/src/igraph/vendor/glpk/misc/triang.c	1
/src/igraph/vendor/glpk/misc/gcd.c	2
/src/igraph/vendor/glpk/intopt/fpump.c	2
/src/igraph/vendor/glpk/misc/rng.c	5
/src/igraph/vendor/glpk/misc/rng1.c	2
/src/igraph/vendor/glpk/draft/glpapi13.c	3
/src/igraph/vendor/glpk/proxy/proxy1.c	1
/src/igraph/vendor/glpk/proxy/proxy.c	16
/src/igraph/vendor/glpk/npp/npp4.c	10
/src/igraph/vendor/glpk/draft/glpios09.c	12
/src/igraph/vendor/glpk/draft/glpapi10.c	1
/src/igraph/vendor/glpk/intopt/gmigen.c	2
/src/igraph/vendor/glpk/intopt/gmicut.c	1
/src/igraph/vendor/glpk/misc/ks.c	8
/src/igraph/vendor/glpk/misc/mt1.c	3
/src/igraph/vendor/glpk/intopt/clqcut.c	1
/src/igraph/vendor/glpk/misc/wclique.c	2
/src/igraph/vendor/glpk/misc/wclique1.c	2
/src/igraph/vendor/glpk/draft/glpios11.c	3
/src/igraph/src/paths/eulerian.c	7
/src/igraph/src/graph/../core/typed_list.pmt	10
/src/igraph/src/graph/graph_list.c	2
/src/igraph/src/operators/subgraph.c	4
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/all_shortest_paths.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/operators/rewire.c	2
/src/igraph/src/graph/basic_query.c	1