/* CHECK */
	// The whole for-loop is in PARDEBUG
	for (n = 0; n < flow->stop - flow->start; n++) {
		DEBUG(PAR, "[%d] %d\n", flow->start + n, n);
		debugInstruction(PAR, mb, 0, getInstrPtr(mb, n + flow->start), LIST_MAL_ALL);
		DEBUG(PAR, "[%d] dependents block count %d wakeup\n", flow->start + n, flow->status[n].blocks);
		for (j = n; flow->edges[j]; j = flow->edges[j]) {
			DEBUG(PAR, "%d\n", flow->start + flow->nodes[j]);
			if (flow->edges[j] == -1)
				break;
		}
	}

----------

	/* CHECK */
	// The 1st DEBUG message and the for loop are both in DEBUG MAL_REDUCE
	DEBUG(MAL_REDUCE, "Variable reduction %d -> %d\n", mb->vtop, cnt);
	for (i = 0; i < mb->vtop; i++)
		DEBUG(MAL_REDUCE, "map %d -> %d\n", i, alias[i]);

----------
			/* CHECK */
			// If is in DEBUG MAL_RESOLVE
			if (sig->polymorphic || sig->retc == p->retc) {
				DEBUG(MAL_RESOLVE, "Resolving\n");
				debugInstruction(MAL_RESOLVE, mb, 0, p, LIST_MAL_ALL);
				DEBUG(MAL_RESOLVE, "Against\n");
				debugInstruction(MAL_RESOLVE, s->def, 0, getSignature(s), LIST_MAL_ALL);
			}
----------

		/* CHECK */
		// From here
		DEBUG(MAL_RESOLVE,
			"Finished %s.%s unmatched=%d polymorphic=%d %d\n",
			getModuleId(sig), getFunctionId(sig), unmatched,
			sig->polymorphic, p == sig);

		if (sig->polymorphic) {
			int l;
			for (l = 0; l < 2 * p->argc; l++)
				if (polytype[l] != TYPE_any) {
					DEBUG(MAL_RESOLVE, "Polymorphic: %d %s\n", l, getTypeName(polytype[l]));
				}
		}

		DEBUG(MAL_RESOLVE, "Resolving\n");
		debugInstruction(MAL_RESOLVE, mb, 0, p, LIST_MAL_ALL);
		DEBUG(MAL_RESOLVE, "Against\n");
		debugInstruction(MAL_RESOLVE, s->def, 0, getSignature(s), LIST_MAL_ALL);

		if(unmatched)
			DEBUG(MAL_RESOLVE,
				"Unmatched '%d' (test: %s - polymorphic: %s)\n",
				unmatched,
				getTypeName(getArgType(mb, p, unmatched)),
				getTypeName(getArgType(s->def, sig, unmatched)));
		// Till here - in in DEBUG MAL_RESOLVE

----------

	/* CHECK */
	// The for-loop is in DEBUG MAL_GROUPBY
	for(i=0; i<a->last; i++)
		DEBUG(MAL_GROUPBY, "Group '%d' unique "BUNFMT "\n", i, a->unique[i]);

-----------

		/* CHECK */
		// If is in DEBUG MAL_TABLET
		if ((i % 1000000) == 0)
			DEBUG(MAL_TABLET, "Dumped " BUNFMT " lines\n", i);

-----------

		/* CHECK */
		// If is in DEBUG MAL_TABLET
		if (!ateof[cur])
			DEBUG(MAL_TABLET,
				"Read '%zu' bytes - pos=%zu eof=%d offset=" LLFMT " \n",
				task->b->len, task->b->pos, task->b->eof, (lng) (s - task->input[cur]));

----------

		/* CHECK */
		// From here
		DEBUG(MAL_OPT_DATAFLOW, "Variable states\n");
		debugInstruction(MAL_OPT_DATAFLOW, mb, 0, p, LIST_MAL_ALL);
		for(k = 0; k < p->argc; k++)
			DEBUG(MAL_OPT_DATAFLOW, "%s %d\n", getVarName(mb,getArg(p,k)), states[getArg(p,k)]);
		// To here - is in DEBUG MAL_OPT_DATAFLOW

----------

	/* CHECK */
	// From here
	int k;
	DEBUG(MAL_OPT_GC, "Garbage collected BAT variables\n");
	for ( k =0; k < mb->vtop; k++)
	DEBUG(MAL_OPT_GC, "%10s eolife %3d begin %3d lastupd %3d end %3d\n",
					getVarName(mb,k), getVarEolife(mb,k),
					getBeginScope(mb,k), getLastUpdate(mb,k), getEndScope(mb,k));
	chkFlow(mb);
	if ( mb->errors != MAL_SUCCEED ){
		DEBUG(MAL_OPT_GC, "%s\n", mb->errors);
		freeException(mb->errors);
		mb->errors = MAL_SUCCEED;
	}
	// To here is in DEBUG MAL_OPT_GC

-----------

	/* CHECK */
	// This part of the code is executed on certain conditions
	// if( OPTdebug &  OPTprojectionpath){
		if( actions > 0){
			chkTypes(cntxt->usermodule, mb, FALSE);
			chkFlow(mb);
			chkDeclarations(mb);
		}
		mnstr_printf(cntxt->fdout,"#projectionpath prefix actions %d\n",actions);
		if(actions) printFunction(cntxt->fdout,mb, 0, LIST_MAL_ALL);
	// }
----------

		/* CHECK */
		// From here
		if( s== NULL) {
			DEBUG(MAL_OPT_REMAP, "Not found\n");
		} else {
			DEBUG(MAL_OPT_REMAP, "Side effects\n");
		}
		// To here is in DBEUG MAL_OPT_REMAP

----------

		/* CHECK */
		// From here
		DEBUG(MAL_OPT_REMAP, "Abort remap\n");
		if (q)
			debugInstruction(MAL_OPT_REMAP, mb, 0, q, LIST_MAL_ALL);
		// To here is in DEBUG MAL_OPT_REMAP

-----------