1. A method comprising: partitioning, via a processor, a program into blocks of code based on a partition of nodes of a control-flow graph for the program, wherein any two consecutive lines of code are placed in a same block if and only if execution of one of the two consecutive lines of code implies execution of the two consecutive lines of code at some point after the execution of the one of the two consecutive lines of code, wherein the nodes of the control-flow graph are partitioned by an algorithm that employs a single type of mark to mark nodes; recursively identifying, via the processor, a set of super nested blocks while traversing the control-flow graph to yield an identified set of super nested blocks; and inserting a probe into an innermost layer of basic blocks in each of the blocks of the identified set of super nested blocks.