Failure splitting USA
Since a couple of weeks or so I'm unable to split USA. I have tried with my own extract and also with the one from Geofabrik <https://download.geofabrik.de/north-america/us-latest.osm.pbf>. Splitter crashes trying to find a nice split. I have tried different --max-nodes values, from 400000 to 1800000, with no success. Version used is 642. Exact map coverage read from input file(s) is (15.920970439910889,-180.0) to (72.98844337463379,180.0) Rounded map coverage is (15.908203125,-180.0) to (72.9931640625,180.0) Splitting nodes into areas containing a maximum of 1,600,000 nodes each... Highest node count in a single grid element is 423,372 Solving partition (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes Trying to find nice split for (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes searching for split with min-nodes 80000, learned 0 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 80000, learned 13540 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 80000, learned 18542 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 80000, learned 21915 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 80000, learned 26044 good partial solutions Elapsed time: 6m 0s Memory: Current 2996MB (406MB used, 2590MB free) Max 27648MB No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 80000, learned 38395 good partial solutions No good solution found, trying to find one accepting anything searching for split with min-nodes 1, learned 83498 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 1, learned 83595 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 1, learned 84812 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 1, learned 84886 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 1, learned 84941 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 1, learned 85011 good partial solutions Still no good solution found, trying alternative algorithm searching for split with min-nodes 80000, learned 85011 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 80000, learned 85012 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 80000, learned 85020 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 80000, learned 85020 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 80000, learned 85494 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 80000, learned 87541 good partial solutions No good solution found, trying to find one accepting anything searching for split with min-nodes 1, learned 88954 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 1, learned 88989 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 1, learned 89006 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 1, learned 90462 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 1, learned 93165 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 1, learned 94259 good partial solutions Warning: No solution found for partition (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes uk.me.parabola.splitter.SplitFailedException: Failed to find a correct split at uk.me.parabola.splitter.solver.SplittableDensityArea.split(SplittableDensityArea.java:162) at uk.me.parabola.splitter.solver.SplittableDensityArea.split(SplittableDensityArea.java:211) at uk.me.parabola.splitter.solver.AreasCalculator.calcAreas(AreasCalculator.java:226) at uk.me.parabola.splitter.Main.split(Main.java:227) at uk.me.parabola.splitter.Main.start(Main.java:121) at uk.me.parabola.splitter.Main.main(Main.java:81)
Hi Carlos, please try the branch version https://www.mkgmap.org.uk/download/splitter-solve-parallel-r641.zip I never found the time to complete the work on this. Would also be good to have the densities-out.txt file. Gerd ________________________________________ Von: mkgmap-dev <mkgmap-dev-bounces@lists.mkgmap.org.uk> im Auftrag von Carlos Dávila <carlos@alternativaslibres.org> Gesendet: Donnerstag, 4. November 2021 16:48 An: Development list for mkgmap Betreff: [mkgmap-dev] Failure splitting USA Since a couple of weeks or so I'm unable to split USA. I have tried with my own extract and also with the one from Geofabrik <https://download.geofabrik.de/north-america/us-latest.osm.pbf>. Splitter crashes trying to find a nice split. I have tried different --max-nodes values, from 400000 to 1800000, with no success. Version used is 642. Exact map coverage read from input file(s) is (15.920970439910889,-180.0) to (72.98844337463379,180.0) Rounded map coverage is (15.908203125,-180.0) to (72.9931640625,180.0) Splitting nodes into areas containing a maximum of 1,600,000 nodes each... Highest node count in a single grid element is 423,372 Solving partition (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes Trying to find nice split for (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes searching for split with min-nodes 80000, learned 0 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 80000, learned 13540 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 80000, learned 18542 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 80000, learned 21915 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 80000, learned 26044 good partial solutions Elapsed time: 6m 0s Memory: Current 2996MB (406MB used, 2590MB free) Max 27648MB No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 80000, learned 38395 good partial solutions No good solution found, trying to find one accepting anything searching for split with min-nodes 1, learned 83498 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 1, learned 83595 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 1, learned 84812 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 1, learned 84886 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 1, learned 84941 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 1, learned 85011 good partial solutions Still no good solution found, trying alternative algorithm searching for split with min-nodes 80000, learned 85011 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 80000, learned 85012 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 80000, learned 85020 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 80000, learned 85020 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 80000, learned 85494 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 80000, learned 87541 good partial solutions No good solution found, trying to find one accepting anything searching for split with min-nodes 1, learned 88954 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 1, learned 88989 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 1, learned 89006 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 1, learned 90462 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 1, learned 93165 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 1, learned 94259 good partial solutions Warning: No solution found for partition (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes uk.me.parabola.splitter.SplitFailedException: Failed to find a correct split at uk.me.parabola.splitter.solver.SplittableDensityArea.split(SplittableDensityArea.java:162) at uk.me.parabola.splitter.solver.SplittableDensityArea.split(SplittableDensityArea.java:211) at uk.me.parabola.splitter.solver.AreasCalculator.calcAreas(AreasCalculator.java:226) at uk.me.parabola.splitter.Main.split(Main.java:227) at uk.me.parabola.splitter.Main.start(Main.java:121) at uk.me.parabola.splitter.Main.main(Main.java:81) _______________________________________________ mkgmap-dev mailing list mkgmap-dev@lists.mkgmap.org.uk https://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev
I have realized the problem occurs since I updated my old version of splitter to r642. Currently splitting with r641, it has already passed the crashing point. https://files.mkgmap.org.uk/download/525/densities-out.txt El 4/11/21 a las 16:52, Gerd Petermann escribió:
Hi Carlos,
please try the branch version https://www.mkgmap.org.uk/download/splitter-solve-parallel-r641.zip I never found the time to complete the work on this. Would also be good to have the densities-out.txt file.
Gerd
________________________________________ Von: mkgmap-dev <mkgmap-dev-bounces@lists.mkgmap.org.uk> im Auftrag von Carlos Dávila <carlos@alternativaslibres.org> Gesendet: Donnerstag, 4. November 2021 16:48 An: Development list for mkgmap Betreff: [mkgmap-dev] Failure splitting USA
Since a couple of weeks or so I'm unable to split USA. I have tried with my own extract and also with the one from Geofabrik <https://download.geofabrik.de/north-america/us-latest.osm.pbf>. Splitter crashes trying to find a nice split. I have tried different --max-nodes values, from 400000 to 1800000, with no success. Version used is 642.
Exact map coverage read from input file(s) is (15.920970439910889,-180.0) to (72.98844337463379,180.0) Rounded map coverage is (15.908203125,-180.0) to (72.9931640625,180.0) Splitting nodes into areas containing a maximum of 1,600,000 nodes each... Highest node count in a single grid element is 423,372 Solving partition (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes Trying to find nice split for (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes searching for split with min-nodes 80000, learned 0 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 80000, learned 13540 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 80000, learned 18542 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 80000, learned 21915 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 80000, learned 26044 good partial solutions Elapsed time: 6m 0s Memory: Current 2996MB (406MB used, 2590MB free) Max 27648MB No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 80000, learned 38395 good partial solutions No good solution found, trying to find one accepting anything searching for split with min-nodes 1, learned 83498 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 1, learned 83595 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 1, learned 84812 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 1, learned 84886 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 1, learned 84941 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 1, learned 85011 good partial solutions Still no good solution found, trying alternative algorithm searching for split with min-nodes 80000, learned 85011 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 80000, learned 85012 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 80000, learned 85020 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 80000, learned 85020 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 80000, learned 85494 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 80000, learned 87541 good partial solutions No good solution found, trying to find one accepting anything searching for split with min-nodes 1, learned 88954 good partial solutions No good solution found, duplicated search-limit to 400000 searching for split with min-nodes 1, learned 88989 good partial solutions No good solution found, duplicated search-limit to 800000 searching for split with min-nodes 1, learned 89006 good partial solutions No good solution found, duplicated search-limit to 1600000 searching for split with min-nodes 1, learned 90462 good partial solutions No good solution found, duplicated search-limit to 3200000 searching for split with min-nodes 1, learned 93165 good partial solutions No good solution found, duplicated search-limit to 6400000 searching for split with min-nodes 1, learned 94259 good partial solutions Warning: No solution found for partition (15.908203125,-180.0) to (71.806640625,-9.5361328125) with 1,036,376,610 nodes uk.me.parabola.splitter.SplitFailedException: Failed to find a correct split at uk.me.parabola.splitter.solver.SplittableDensityArea.split(SplittableDensityArea.java:162) at uk.me.parabola.splitter.solver.SplittableDensityArea.split(SplittableDensityArea.java:211) at uk.me.parabola.splitter.solver.AreasCalculator.calcAreas(AreasCalculator.java:226) at uk.me.parabola.splitter.Main.split(Main.java:227) at uk.me.parabola.splitter.Main.start(Main.java:121) at uk.me.parabola.splitter.Main.main(Main.java:81)
_______________________________________________ mkgmap-dev mailing list mkgmap-dev@lists.mkgmap.org.uk https://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev _______________________________________________ mkgmap-dev mailing list mkgmap-dev@lists.mkgmap.org.uk https://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev
participants (2)
-
Carlos Dávila -
Gerd Petermann