 		*reinterpret_cast<NetworkV1::route_t (*)[RouteCache::MAX_DST_NODES][RouteCache::MAX_DST_ROUTES]>(route_ptr);
 	
 	//Phase 1: check remove_all()
-	trace << PSTR("[testRemove] Phase 1: check remove_all() ") << endl;
+	trace << PSTR("[testRemove] Phase 1: check remove_all()") << endl;
 	//Step 1: add routes
+	trace << PSTR("[testRemove] Adding routes...") << endl;
 	for ( int i = 0; i < RouteCache::MAX_DST_NODES; i ++ )
 		for ( int j = 0; j < RouteCache::MAX_DST_ROUTES; j ++ )
 			route_cache->add_route_entry(&route[i][j], false);

	//ok, must assume that this works in order to use it as a cleanup
	route_cache.remove_all();
	
	//Test 3: verify that getters return correct data
	result &= testGetters(&route_cache, (void*)routes);
//	if (!result)
//		printRouteCache(&route_cache);
	//ok, must assume that this works in order to use it as a cleanup
	route_cache.remove_all();
	
	
	//add_route_entry(route, true)//force replace
	//update_QoS, get_QoS

	//Phase 2: check remove_all_for_dst()
	trace << PSTR("[testRemove] Phase 2: check remove_all_for_dst() ") << endl;
	//Step 1: add routes
	trace << PSTR("[testRemove] Adding routes...") << endl;
	for ( int i = 0; i < RouteCache::MAX_DST_NODES; i ++ )
		for ( int j = 0; j < RouteCache::MAX_DST_ROUTES; j ++ )
			route_cache->add_route_entry(&route[i][j], false);
	
	trace << PSTR("[testRemove] Removing all routes via remove_all_for_dst()") << endl;
	//Step 2: remove all routes via remove_all_for_dst
	for ( int i = 0; i < RouteCache::MAX_DST_NODES; i ++ )
		for ( int j = 0; j < RouteCache::MAX_DST_ROUTES; j ++ )
