diff --git a/src/test/java/it/unibz/inf/isochrone/network/RuntimeComplex.java b/src/test/java/it/unibz/inf/isochrone/network/RuntimeComplex.java
index e20a31bd04c46e08139ead02f0176cb3169763ae..fa9291f7a4616478e03002c4e753d9ea9af2c34c 100644
--- a/src/test/java/it/unibz/inf/isochrone/network/RuntimeComplex.java
+++ b/src/test/java/it/unibz/inf/isochrone/network/RuntimeComplex.java
@@ -156,8 +156,8 @@ public final class RuntimeComplex {
 		final Set<Integer> times = new TreeSet<Integer>();
 		for (int offset : RUNTIME_OFFSETS) {
 			int stepWidth = (offset / RUNTIME_POINTS_PER_OFFSET);
-			for (int i = 1; i < offset; i += stepWidth) {
-				int runtime = offset * i;
+			for (int i = 0; i < offset; i += stepWidth) {
+				int runtime = Math.max(offset, offset * i);
 				if (runtime > MAX_RUNTIME) {
 					return times;
 				}