diff --git a/src/test/java/it/unibz/inf/isochrone/network/AlgorithmRuntimeTest.java b/src/test/java/it/unibz/inf/isochrone/network/AlgorithmRuntimeTest.java
index bff55d0211730d5f87127470f22eacbfbd66023b..d06d522aa01400b1fcd14ebc34fdfea95097fefb 100644
--- a/src/test/java/it/unibz/inf/isochrone/network/AlgorithmRuntimeTest.java
+++ b/src/test/java/it/unibz/inf/isochrone/network/AlgorithmRuntimeTest.java
@@ -43,12 +43,16 @@ public final class AlgorithmRuntimeTest {
 	private static final Mode MODE = Mode.MULTIMODAL;
 	private static final double WALKING_SPEED = 1.0;
 	private static final int MAX_RUNTIME = 18000; // 5 hours;
-	private static final int RUNTIME_POINTS_PER_OFFSET = 12;
 	private static final int[] RUNTIME_OFFSETS = {
 		60,		// 1 minute (in sec)
 		3600,	// 1 hour (in sec)
 		86400	// 1 day (in sec)
 	};
+	private static final int[] RUNTIME_POINTS_PER_OFFSET = {
+		5,		// every 5 minutes
+		2, 		// every 2 hours
+		1		// every day
+	};
 	private static Map<String, InitParams> initParamsMap;
 	private static List<TestParameters> datsetParams = new ArrayList<>();
 	private static Map<String, Map<String, Long>> runtimes = new LinkedHashMap<>();
@@ -172,10 +176,11 @@ public final class AlgorithmRuntimeTest {
 		}
 
 		times = new TreeSet<Integer>();
-		for (int offset : RUNTIME_OFFSETS) {
-			int stepWidth = (offset / RUNTIME_POINTS_PER_OFFSET);
-			for (int i = 0; i < offset; i += stepWidth) {
-				int runtime = Math.max(offset, offset * i);
+		for (int i = 0; i < RUNTIME_OFFSETS.length; ++i) {
+			int offset = RUNTIME_OFFSETS[i];
+			int stepWidth = RUNTIME_POINTS_PER_OFFSET[i];
+			for (int j = 0; j < offset; j += stepWidth) {
+				int runtime = Math.max(offset, offset * j);
 				if (runtime > MAX_RUNTIME) {
 					return;
 				}