/**
 * Copyright (c) 2015, Ecole des Mines de Nantes
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    This product includes software developed by the <organization>.
 * 4. Neither the name of the <organization> nor the
 *    names of its contributors may be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ''AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package org.chocosolver.solver.search;

import org.chocosolver.solver.Model;
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.search.limits.FailCounter;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.util.ProblemMaker;
import org.testng.annotations.Test;

import static java.lang.System.out;
import static org.chocosolver.solver.search.strategy.SearchStrategyFactory.activityBasedSearch;
import static org.chocosolver.solver.search.strategy.SearchStrategyFactory.domOverWDegSearch;
import static org.testng.Assert.assertEquals;

/**
 * @author Jean-Guillaume Fages
 * @since 22/04/15
 * Created by IntelliJ IDEA.
 */
public class ActivityTest {

	@Test(groups="10s", timeOut=60000)
	public void testCostas() {
		Model s1 = costasArray(7, false);
		Model s2 = costasArray(7, true);

		while (s1.solve()) ;
		out.println(s1.getSolver().getSolutionCount());

		while (s2.solve()) ;

		out.println(s2.getSolver().getSolutionCount());
		assertEquals(s1.getSolver().getSolutionCount(), s2.getSolver().getSolutionCount());
	}

	private Model costasArray(int n, boolean activity){
		Model model = ProblemMaker.makeCostasArrays(n);
		IntVar[] vectors = (IntVar[]) model.getHook("vectors");

		Solver r = model.getSolver();
		r.limitTime(20000);
		if(activity){
			r.set(activityBasedSearch(vectors));
			r.setGeometricalRestart(vectors.length * 3, 1.1d, new FailCounter(model, 0), 1000);
			r.setNoGoodRecordingFromRestarts();
		}else{
			r.set(domOverWDegSearch(vectors));
		}
		return model;
	}
}

@@ -1905,24 +1905,93 @@
 ailCounter;%0A
+import org.chocosolver.solver.search.strategy.SearchStrategyFactory;%0A
 import org.c
@@ -2241,102 +2241,8 @@
 ch;%0A
-import static org.chocosolver.solver.search.strategy.SearchStrategyFactory.domOverWDegSearch;%0A
 impo
@@ -2971,16 +2971,18 @@
 er();%0A%09%09
+//
 r.limitT
@@ -2985,18 +2985,17 @@
 mitTime(
-20
+5
 000);%0A%09%09
@@ -3135,19 +3135,28 @@
  1000);%0A
-%09%09%09
+            
 r.setNoG
@@ -3175,17 +3175,25 @@
 From
-Restarts(
+Solutions(vectors
 );%0A%09
@@ -3213,19 +3213,42 @@
 set(
-domOverWDeg
+SearchStrategyFactory.inputOrderLB
 Sear

Fix ABS