Hi,
I apologize for the late response.
Please let us know if you are not happy with the grading in the end or if the question is still unclear.
No, we do not mean executions.
Generally, we are interested in different execution paths within the application which can be triggered using different inputs.
Let me give you a crude explanation:
While I am currently not sure how exactly AFL internally represents the execution flow of the application, you could think of it as a graph.
Each state represents a specific code location.
Each edge represents a "jump" from one code location to another.
In order to walk a edge on the graph, you need to form the input in the way which led to the discovery of this "jump".
Therefore, we want you to answer how many edges (~jumps) were found once the first crash happened.
This is written in one of the files generated by the fuzzer.
Cheers,
Sebastian