1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 0 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Fort-de-France.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Valenciennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zac Tz'otz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Altai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Orléans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for St. Paul.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Angers.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Bulgan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Évora.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Fargo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Metz.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Ölgii.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Saqik'ajol Nimakaqapek.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Wichita.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for K'abaaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Setúbal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sintra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Aphroditopolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Chicago.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Venezia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Anpet-Djedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Caen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pelusium.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 10 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Lyon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Atlanta.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Itji-Tawi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 18 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Kaegyong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Kaegyong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Jolbon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 22 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Coimbra.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Silves.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 23 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 24 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 25 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Taminhor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 27 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 28 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Torino.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 29 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Kaegyong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 30 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Naucratis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 31 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 32 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 33 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 34 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 35 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Ungjin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 36 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 37 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Braga.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 38 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Jolbon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Sheresi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 39 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 40 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 41 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Nancy.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Per-Usiri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 42 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 43 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Ox Witz Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 44 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Bari.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 45 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 46 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 47 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 48 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Guarda.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 49 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 50 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Kaegyong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 51 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 52 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 53 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 54 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 55 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 56 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 57 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 58 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 59 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 60 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Gebtiu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 61 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Kaegyong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 62 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Elvas.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 63 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 64 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 65 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 66 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 67 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 68 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 69 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 70 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Choibalsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 71 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Kochilsan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 72 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 73 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 74 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 75 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 76 iterations for Tjeb-Neter.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 77 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 78 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 79 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 80 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 81 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 82 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 83 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 84 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 85 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 85 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 85 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 85 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 85 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 85 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 85 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 86 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 87 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 87 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 87 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 88 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 89 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 90 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Portalegre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 91 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 92 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 93 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 94 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 94 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 94 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 94 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 94 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 94 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 94 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 95 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 96 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 97 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 98 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 99 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 100 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 100 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 100 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 100 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 100 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 100 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 101 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 101 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 101 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 101 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 101 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 101 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 102 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 103 iterations for Zuunmod.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Le Havre.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 104 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Kaegyong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 105 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 106 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 107 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 108 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 109 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 110 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 111 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 112 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 113 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 114 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 115 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 116 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Firenze.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Kaegyong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 117 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Canopus.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 118 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 119 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 119 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 119 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 119 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 119 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 120 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 121 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 122 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 123 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 124 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Napoli.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 125 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 126 iterations for Tomar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 127 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 128 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 129 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 130 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 131 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 132 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 133 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Montpellier.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 134 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Khovd.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 135 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 136 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 136 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 136 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 136 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 137 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 138 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 139 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 140 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 140 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 140 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 141 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 141 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 141 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 141 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 141 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 141 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 141 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 142 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 143 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 144 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 144 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 144 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 144 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 144 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 144 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 144 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 145 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 145 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 145 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 145 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 146 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 146 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 146 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 146 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 147 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 148 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 149 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 149 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 149 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 149 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 149 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 150 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 151 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 152 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 153 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 153 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 153 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 153 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 153 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 153 iterations for Jolbon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 153 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 154 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 155 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 155 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 156 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 156 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 157 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 157 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 157 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 157 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 157 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 157 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 158 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 159 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 160 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 161 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 162 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 163 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 164 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 165 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 166 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 166 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 166 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 166 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 167 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 168 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 169 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 170 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 170 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 170 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 171 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 172 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Cob Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 173 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 174 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 175 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 176 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 176 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 176 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 176 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 176 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 176 iterations for Lille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 177 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 177 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 177 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 177 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 178 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 178 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 178 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 178 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 178 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 178 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 178 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 179 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 179 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 179 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 179 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 179 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 179 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 179 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 180 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 180 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 180 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 181 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 182 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 184 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 185 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 186 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 186 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 186 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 186 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 186 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 186 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 186 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 187 iterations for Wiryesong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 188 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 188 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 188 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 188 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 188 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 188 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 188 iterations for Wiryesong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 189 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 190 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 191 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 192 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 193 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 193 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 193 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 193 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 193 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 193 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 193 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 194 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for Rouen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 195 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 196 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 196 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 196 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 196 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 196 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 196 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 196 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Djanenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 197 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 198 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 198 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 198 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 198 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 198 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 198 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 198 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 199 iterations for Porto.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Öndörkhaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Santarém.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 200 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 201 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 202 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 202 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 202 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 202 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 203 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 203 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 203 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 203 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 204 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 205 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 205 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 205 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 205 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 205 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 206 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 206 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 206 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 206 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 206 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 207 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 207 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 207 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 207 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 207 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 207 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 208 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 209 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 209 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 209 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 209 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 209 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 209 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 209 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 210 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 211 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 212 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 212 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 212 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 212 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 212 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 213 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 213 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 214 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 215 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for Seattle.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 216 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 217 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 218 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 219 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 219 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 219 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 220 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 220 iterations for Milano.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 220 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 221 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 221 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 221 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 221 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 222 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 222 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 222 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 222 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 222 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 223 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 223 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 224 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 224 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 224 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 224 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 224 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 225 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 225 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 226 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 226 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 226 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 226 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 226 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 226 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 227 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 227 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 228 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 228 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 228 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 228 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 228 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 228 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 228 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 229 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 230 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Ungjin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Ungjin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Ungjin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 231 iterations for Ungjin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 232 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 232 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 232 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 232 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 232 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 232 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 233 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 233 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 233 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 233 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 233 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 234 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 235 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 235 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 235 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 236 iterations for Yuni.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 237 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 239 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 241 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 241 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 242 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 243 iterations for Jolbon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 243 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 243 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 243 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 244 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 245 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 246 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 247 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 248 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 248 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 249 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 250 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 251 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 252 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 252 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 252 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 252 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 253 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 254 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 255 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 255 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 255 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Maayapáan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 256 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 257 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 257 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 257 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 257 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 257 iterations for Lakam Ja'.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 257 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 257 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 258 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 258 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 258 iterations for Marseille.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 259 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 259 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 261 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 261 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 262 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 262 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 262 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 262 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 262 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 263 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 263 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 263 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 263 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 264 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 264 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 264 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 264 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 264 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 265 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 266 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 266 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 266 iterations for Lop Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 266 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 269 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 269 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 270 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 271 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 272 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 272 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 272 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 272 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 272 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 272 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 272 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 273 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 273 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 273 iterations for Wiryesong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 273 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 274 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 274 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 274 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 274 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 274 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 274 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 275 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 276 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 277 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 278 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 278 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 279 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 279 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 279 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 280 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 280 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 280 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 281 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 281 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 281 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 281 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 281 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 284 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 285 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 285 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 285 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 285 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 285 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 285 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 286 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 287 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 287 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 287 iterations for Clermont-Ferrand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 288 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 288 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 288 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 288 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 288 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 289 iterations for Yax Mutal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 291 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 292 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 292 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 292 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 292 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 292 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 292 iterations for Per-Banebdjedet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 293 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 293 iterations for Sauti.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 293 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 293 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 294 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 296 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 297 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 297 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 297 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 298 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 298 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 298 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 298 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 299 iterations for Jolbon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 299 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 300 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 300 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 300 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 300 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 300 iterations for Tours.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 301 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 301 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 301 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 301 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 301 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 301 iterations for Wanggomsong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 302 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 302 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 302 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 302 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 302 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 303 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 303 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 304 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 306 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 307 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 307 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 308 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 308 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 308 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 308 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 308 iterations for Yunu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 309 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 310 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 310 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 310 iterations for Strasbourg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Kaminaljuyu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Minneapolis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 313 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 314 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 314 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 314 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 315 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 315 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 319 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 321 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 324 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 324 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 325 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 325 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 325 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 325 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 325 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 325 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 325 iterations for Paris.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 326 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 326 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 326 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 326 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 327 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 327 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 327 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 327 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 328 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 328 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 328 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 328 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 329 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 329 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 331 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 331 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 331 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 331 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 332 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 332 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 333 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 335 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 337 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 337 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 338 iterations for Bologna.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 340 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 340 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 340 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 341 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 341 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 342 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 342 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 342 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 342 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 342 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 342 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 342 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 343 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 343 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 343 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 344 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 345 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 346 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 347 iterations for Hanyang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 347 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 347 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 347 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 348 iterations for Wanggomsong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 349 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 349 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 350 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 350 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 350 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 350 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 351 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 351 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 351 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 351 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 351 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 353 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 354 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 354 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 355 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 355 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 356 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 356 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 357 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 357 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 357 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 359 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 359 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 361 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 363 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 364 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 364 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 365 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 365 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 365 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 365 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 365 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 366 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 371 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 371 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 371 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 372 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 372 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 372 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 373 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 373 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 376 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 377 iterations for Pi-Rameses.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 380 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 381 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 381 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 381 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 383 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 384 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 384 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 384 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 384 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 385 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 387 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 388 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 388 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 388 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 388 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 388 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 389 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 390 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 390 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 390 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 390 iterations for Detroit.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 390 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 390 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 391 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 394 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 394 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 395 iterations for Ungjin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 397 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 398 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 398 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 399 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 400 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 400 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 400 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 400 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 400 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 403 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 404 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 405 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 407 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 407 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 409 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 409 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 409 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 409 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 409 iterations for Sükhbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 410 iterations for Sabi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 411 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 412 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 412 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 412 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 414 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 415 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 415 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 415 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 415 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 415 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 415 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 418 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 418 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 418 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 418 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 420 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 421 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 422 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 422 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 422 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 422 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 422 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 422 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 424 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 424 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 424 iterations for Óbidos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 424 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 425 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 425 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 427 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 430 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 431 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 431 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 433 iterations for Jolbon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 434 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 434 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 435 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 435 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 435 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 440 iterations for Hardai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 440 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 440 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 440 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 440 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 442 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 442 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 442 iterations for Genova.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 442 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 443 iterations for Jolbon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 443 iterations for Wiryesong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 444 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 444 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 446 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 446 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 446 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 446 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 446 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 446 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 448 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 449 iterations for Leiria.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 449 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 449 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 452 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 453 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 458 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 458 iterations for Wanggomsong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 461 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 461 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 463 iterations for Los Angeles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 464 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 464 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 464 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 467 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 467 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 467 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 469 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 469 iterations for Wanggomsong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 471 iterations for Wiryesong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 472 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 472 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 472 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 472 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 476 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 476 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 477 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 477 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 478 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 479 iterations for Wanggomsong.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 480 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 481 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 481 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 481 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 482 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 482 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 483 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 484 iterations for Hat Yai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 484 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 488 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 489 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 490 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 490 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 493 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 493 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 493 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 494 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 494 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 494 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 495 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Imu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 500 iterations for Oxwitik.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 501 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 502 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 503 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 503 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 504 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 505 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 506 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 506 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 506 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 509 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 512 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 512 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 512 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 512 iterations for Per-Medjed.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 513 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 513 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 513 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 513 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 513 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 513 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 514 iterations for Zama.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 515 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 515 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 518 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 522 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 524 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 524 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 524 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 524 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 526 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 526 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 526 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 526 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 526 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 526 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 535 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 536 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 536 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 536 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 536 iterations for St. Louis.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 538 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 539 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 545 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 545 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 545 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 545 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 549 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 549 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 549 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 550 iterations for Brest.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 553 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 553 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 553 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 554 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 556 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 557 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 557 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 557 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 557 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 558 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 559 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 559 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 564 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 564 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 564 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 566 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 566 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 571 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 571 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 576 iterations for Faro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 578 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 578 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 582 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 582 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 582 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 586 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 588 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 590 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 592 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 592 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 595 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 595 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 595 iterations for Sainshand.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 597 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 597 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 598 iterations for Miami.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 599 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 599 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 599 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 599 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 605 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 608 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 608 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 609 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 611 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 616 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 616 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 618 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 619 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 620 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 621 iterations for Abdju.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 621 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 626 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 630 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 643 iterations for Viseu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 646 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 647 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 650 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 650 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 650 iterations for Züünkharaa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 651 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 651 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 651 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 651 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 651 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 652 iterations for Vila Real.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 656 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 657 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 659 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 667 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 680 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 681 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 683 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 683 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 683 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 684 iterations for Chi'che'en Itsa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 686 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 686 iterations for Kaan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 687 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 688 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 689 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 693 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 693 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 701 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 702 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 704 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 704 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 713 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 713 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 714 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 727 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 728 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 729 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 729 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 729 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 734 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 735 iterations for Nakhon Rachasima.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 735 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 735 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 736 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 737 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 743 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 752 iterations for New York.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 758 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 758 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 759 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 759 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 759 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 759 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 767 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 772 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 772 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 774 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 775 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 781 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 783 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 793 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 797 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 800 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 800 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 802 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 803 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 809 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 812 iterations for New Orleans.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 819 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 820 iterations for Chaswu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 838 iterations for Nantes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 841 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 841 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 841 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 841 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 841 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 841 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 847 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 852 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 853 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 853 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 853 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 853 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 855 iterations for Pa' Chan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 861 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 861 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 862 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 869 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 874 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 874 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 874 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 874 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 874 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 875 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 875 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 875 iterations for Thon Buri.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 878 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 879 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 879 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 882 iterations for Chiang Rai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 890 iterations for Bordeaux.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 895 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 895 iterations for Nice.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 898 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 906 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 906 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 906 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 921 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 927 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 927 iterations for Rennes.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 935 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 935 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 935 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 935 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 935 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 937 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 942 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 949 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 949 iterations for Versailles.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 952 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 954 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 954 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 956 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 956 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 956 iterations for Boston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 968 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 968 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 968 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 968 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 971 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 972 iterations for Baltimore.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 974 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1005 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1007 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1011 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1011 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1012 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1013 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1015 iterations for Toulouse.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1019 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1022 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1041 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1041 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1041 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1041 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1041 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1041 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1041 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1043 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1056 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1072 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1072 iterations for Houston.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1085 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1087 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1088 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1088 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1088 iterations for Popo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1095 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1111 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1127 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1137 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1145 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1145 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1145 iterations for Ulaangom.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1149 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1163 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1171 iterations for Sa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1176 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1195 iterations for Altanbulag.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1197 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1197 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1201 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1202 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1213 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1228 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1244 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1257 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1264 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1265 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1276 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1276 iterations for Barcelos.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1282 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1287 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1287 iterations for Lampang.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1290 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1296 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1297 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1297 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1297 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1297 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1306 iterations for Ulaanbaatar.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1333 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1352 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1354 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1355 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1367 iterations for Akhet-Aton.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1369 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1387 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1402 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1404 iterations for Roma.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1415 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1420 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1427 iterations for Grenoble.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1432 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1432 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1441 iterations for Bayankhongor.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1441 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1448 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1448 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1501 iterations for Mörön.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1505 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1525 iterations for Ungjin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1527 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1532 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1532 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1532 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1558 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1566 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1585 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1587 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1594 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1596 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1625 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1625 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1650 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1650 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1650 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1650 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1665 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1670 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1686 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1735 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1739 iterations for Óox Máal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1743 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1743 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1747 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1752 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1771 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1799 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1801 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1811 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1811 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1811 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1811 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1811 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1811 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1811 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1820 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1820 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1820 iterations for Philadelphia.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1831 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1833 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1835 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1835 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1869 iterations for Wandu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1872 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1911 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1911 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1928 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1928 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1928 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1928 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1954 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1972 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1973 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 1973 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2009 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2010 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2043 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2049 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2061 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2061 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2077 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2090 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2090 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2090 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2090 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2103 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2158 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2159 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2221 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2223 iterations for Lam'an'ain.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2259 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2292 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2298 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2301 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2307 iterations for Dalanzadgad.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2363 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2365 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2365 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2365 iterations for Bangkok.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2371 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2391 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2503 iterations for Erdenet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2631 iterations for Henen-Nesut.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2644 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2679 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2679 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2679 iterations for Lisboa.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2690 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2697 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2697 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2697 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2750 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2755 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2805 iterations for Bragança.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2823 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2823 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2823 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2948 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 2996 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3016 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3049 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3049 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3050 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3050 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3050 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3050 iterations for Chumphon.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3050 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3072 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3074 iterations for Siaan K'aan.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3102 iterations for Mandalgovi.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3181 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3181 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3196 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3218 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3228 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3261 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3307 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3348 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3348 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3348 iterations for Hua Hin.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3352 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3362 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3366 iterations for Arvaikheer.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3368 iterations for Q'umarkaj.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3381 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3381 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3381 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3461 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3461 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3471 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3515 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3515 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3552 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3673 iterations for Aveiro.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3694 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3699 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3699 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3708 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3765 iterations for Guimarães.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3798 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3798 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3860 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3944 iterations for Khem.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3992 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3992 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 3992 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4043 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4355 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4606 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4643 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4644 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4653 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4719 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4758 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 4759 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5128 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5135 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5303 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5399 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5502 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5551 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5663 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5663 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 5897 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6257 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6299 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6437 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6510 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6527 iterations for Khon Kaen.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6531 iterations for Palermo.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6701 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6807 iterations for Alcácer do Sal.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 6958 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7011 iterations for Waset.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7135 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7196 iterations for Tsetserleg.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7286 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 7286 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 8156 iterations for Per-Bastet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9185 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9185 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9185 iterations for This.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9523 iterations for Behdet.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 9963 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 11304 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12294 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12294 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12474 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 12474 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13094 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 13359 iterations for Chiang Mai.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 14265 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15555 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 15555 iterations for Ipu.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 16310 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17743 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 17743 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19424 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19424 iterations for Washington.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 19634 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 20498 iterations for Rakote.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 21031 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1989]: OK : find a cm solution in 26750 iterations for Karakorum.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Djeuka.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Ineb-Hedj.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Suentet.
1: in cm_find_best_solution() [cm.c::1982]: Did not find a cm solution in 27501 iterations for Washington.