SpoonLabs · martinezmatias · May 28, 2025 · May 28, 2025 · May 28, 2025 · Jun 3, 2025
diff --git a/.vscode/launch.json b/.vscode/launch.json
@@ -0,0 +1,56 @@
+{
+    // Use IntelliSense to learn about possible attributes.
+    // Hover to view descriptions of existing attributes.
+    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "type": "java",
+            "name": "QuixBugsRepairTestLLM",
+            "request": "launch",
+            "mainClass": "fr.inria.astor.test.repair.QuixBugsRepairTestLLM",
+            "projectName": "astor"
+        },
+        {
+            "type": "java",
+            "name": "Current File",
+            "request": "launch",
+            "mainClass": "${file}"
+        },
+        {
+            "type": "java",
+            "name": "_3sFix",
+            "request": "launch",
+            "mainClass": "fr.inria.astor.approaches._3sfix._3sFix",
+            "projectName": "astor"
+        },
+        {
+            "type": "java",
+            "name": "JUnitExternalExecutor",
+            "request": "launch",
+            "mainClass": "fr.inria.astor.core.validation.junit.JUnitExternalExecutor",
+            "projectName": "astor"
+        },
+        {
+            "type": "java",
+            "name": "JUnitNologExternalExecutor",
+            "request": "launch",
+            "mainClass": "fr.inria.astor.core.validation.junit.JUnitNologExternalExecutor",
+            "projectName": "astor"
+        },
+        {
+            "type": "java",
+            "name": "FaultLocalizationMain",
+            "request": "launch",
+            "mainClass": "fr.inria.main.FaultLocalizationMain",
+            "projectName": "astor"
+        },
+        {
+            "type": "java",
+            "name": "AstorMain",
+            "request": "launch",
+            "mainClass": "fr.inria.main.evolution.AstorMain",
+            "projectName": "astor"
+        }
+    ]
+}
diff --git a/.vscode/settings.json b/.vscode/settings.json
@@ -0,0 +1,3 @@
+{
+    "java.configuration.updateBuildConfiguration": "interactive"
+}
diff --git a/diffSolutions/patch_100580_416.diff b/diffSolutions/patch_100580_416.diff
@@ -0,0 +1,14 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
+@@ -35,5 +35,5 @@
+-			return output;
+-		} else {
+-			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>();
+-			empty_set.add(new java.util.ArrayList());
+-			return empty_set;
++
++
++
++
++			return rest_subsets;} else { 			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>(); 			empty_set.add(new java.util.ArrayList()); 			return empty_set;
+
diff --git a/diffSolutions/patch_101062_620.diff b/diffSolutions/patch_101062_620.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\quixbugscompiled\lis\src\java_programs\LIS.java
++++ C:\astor\examples\quixbugscompiled\lis\src\java_programs\LIS.java
+@@ -29,2 +29,2 @@
+-			if ((length == longest) || (val < arr[ends.get(length + 1)])) {
+-				ends.put(length + 1, i);
++
++			ends.put(length + 1, i); 			if ((length == longest) || (val < arr[ends.get(length + 1)])) { 				ends.put(length + 1, i);
+
diff --git a/diffSolutions/patch_102483_554.diff b/diffSolutions/patch_102483_554.diff
@@ -0,0 +1,6 @@
+--- C:\astor\examples\quixbugscompiled\hanoi\src\java_programs\HANOI.java
++++ C:\astor\examples\quixbugscompiled\hanoi\src\java_programs\HANOI.java
+@@ -27 +27 @@
+-			steps.add(new java_programs.HANOI.Pair<java.lang.Integer, java.lang.Integer>(start, helper));
++			steps.add(new java_programs.HANOI.Pair<java.lang.Integer, java.lang.Integer>(start, end));
+
diff --git a/diffSolutions/patch_102676_416.diff b/diffSolutions/patch_102676_416.diff
@@ -0,0 +1,14 @@
+--- C:\astor\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
++++ C:\astor\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
+@@ -35,5 +35,5 @@
+-			return output;
+-		} else {
+-			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>();
+-			empty_set.add(new java.util.ArrayList());
+-			return empty_set;
++
++
++
++
++			return rest_subsets;} else { 			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>(); 			empty_set.add(new java.util.ArrayList()); 			return empty_set;
+
diff --git a/diffSolutions/patch_106837_416.diff b/diffSolutions/patch_106837_416.diff
@@ -0,0 +1,14 @@
+--- C:\astor\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
++++ C:\astor\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
+@@ -35,5 +35,5 @@
+-			return output;
+-		} else {
+-			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>();
+-			empty_set.add(new java.util.ArrayList());
+-			return empty_set;
++
++
++
++
++			return rest_subsets;} else { 			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>(); 			empty_set.add(new java.util.ArrayList()); 			return empty_set;
+
diff --git a/diffSolutions/patch_1073_2.diff b/diffSolutions/patch_1073_2.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\quixbugscompiled\depth_first_search\src\java_programs\Node.java
++++ C:\astor\examples\quixbugscompiled\depth_first_search\src\java_programs\Node.java
+@@ -49,2 +49,2 @@
+-	public void setSuccessors(java.util.ArrayList<java_programs.Node> successors) {
+-		this.successors = successors;
++	public void setSuccessors(java.util.ArrayList<java_programs.Node> successors) { 		new java_programs.Node("Waterloo", new java.util.ArrayList<java_programs.Node>(java.util.Arrays.asList(successor))).successors = 
++		successors;
+
diff --git a/diffSolutions/patch_107573_620.diff b/diffSolutions/patch_107573_620.diff
@@ -0,0 +1,8 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\lis\src\java_programs\LIS.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\lis\src\java_programs\LIS.java
+@@ -29,2 +29,2 @@
+-			if ((length == longest) || (val < arr[ends.get(length + 1)])) {
+-				ends.put(length + 1, i);
++
++			ends.put(length + 1, i); 			if ((length == longest) || (val < arr[ends.get(length + 1)])) { 				ends.put(length + 1, i);
+
diff --git a/diffSolutions/patch_10805_12.diff b/diffSolutions/patch_10805_12.diff
@@ -0,0 +1,8 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\get_factors\src\java_programs\GET_FACTORS.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\get_factors\src\java_programs\GET_FACTORS.java
+@@ -19,2 +19,2 @@
+-		for (int i = 2; i < max; i++) {
+-			if ((n % i) == 0) {
++		for (int i = 2; 
++		(n % n) == 0; i++) { 			if ((n % i) == 0) {
+
diff --git a/diffSolutions/patch_110079_416.diff b/diffSolutions/patch_110079_416.diff
@@ -0,0 +1,14 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
+@@ -35,5 +35,5 @@
+-			return output;
+-		} else {
+-			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>();
+-			empty_set.add(new java.util.ArrayList());
+-			return empty_set;
++
++
++
++
++			return rest_subsets;} else { 			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>(); 			empty_set.add(new java.util.ArrayList()); 			return empty_set;
+
diff --git a/diffSolutions/patch_110272_416.diff b/diffSolutions/patch_110272_416.diff
@@ -0,0 +1,14 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
+@@ -35,5 +35,5 @@
+-			return output;
+-		} else {
+-			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>();
+-			empty_set.add(new java.util.ArrayList());
+-			return empty_set;
++
++
++
++
++			return rest_subsets;} else { 			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>(); 			empty_set.add(new java.util.ArrayList()); 			return empty_set;
+
diff --git a/diffSolutions/patch_11181_31.diff b/diffSolutions/patch_11181_31.diff
@@ -0,0 +1,6 @@
+--- C:\astor\examples\quixbugscompiled\quicksort\src\java_programs\QUICKSORT.java
++++ C:\astor\examples\quixbugscompiled\quicksort\src\java_programs\QUICKSORT.java
+@@ -26 +26 @@
+-			} else if (x > pivot) {
++			} else if (true) {
+
diff --git a/diffSolutions/patch_111842_554.diff b/diffSolutions/patch_111842_554.diff
@@ -0,0 +1,6 @@
+--- C:\astor\examples\quixbugscompiled\hanoi\src\java_programs\HANOI.java
++++ C:\astor\examples\quixbugscompiled\hanoi\src\java_programs\HANOI.java
+@@ -27 +27 @@
+-			steps.add(new java_programs.HANOI.Pair<java.lang.Integer, java.lang.Integer>(start, helper));
++			steps.add(new java_programs.HANOI.Pair<java.lang.Integer, java.lang.Integer>(start, end));
+
diff --git a/diffSolutions/patch_1118_2.diff b/diffSolutions/patch_1118_2.diff
@@ -0,0 +1,8 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\depth_first_search\src\java_programs\Node.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\depth_first_search\src\java_programs\Node.java
+@@ -49,2 +49,2 @@
+-	public void setSuccessors(java.util.ArrayList<java_programs.Node> successors) {
+-		this.successors = successors;
++	public void setSuccessors(java.util.ArrayList<java_programs.Node> successors) { 		new java_programs.Node("Waterloo", new java.util.ArrayList<java_programs.Node>(java.util.Arrays.asList(successor))).successors = 
++		successors;
+
diff --git a/diffSolutions/patch_11698_7.diff b/diffSolutions/patch_11698_7.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\depth_first_search\src\java_programs\DEPTH_FIRST_SEARCH.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\depth_first_search\src\java_programs\DEPTH_FIRST_SEARCH.java
+@@ -23 +23 @@
+-						if (search(successornodes)) { 							return true;}
++						if (node == node) { 							return true;}
+
diff --git a/diffSolutions/patch_128480_120.diff b/diffSolutions/patch_128480_120.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_130142_122.diff b/diffSolutions/patch_130142_122.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_132639_120.diff b/diffSolutions/patch_132639_120.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_13278_110.diff b/diffSolutions/patch_13278_110.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
++++ C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
+@@ -71,2 +71,2 @@
+-	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException {
+-		return solve(min, max);
++	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException { 		return solve(f, min, max);
++
+
diff --git a/diffSolutions/patch_13363_110.diff b/diffSolutions/patch_13363_110.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
++++ C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
+@@ -71,2 +71,2 @@
+-	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException {
+-		return solve(min, max);
++	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException { 		return solve(f, min, max);
++
+
diff --git a/diffSolutions/patch_134539_122.diff b/diffSolutions/patch_134539_122.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_134847_120.diff b/diffSolutions/patch_134847_120.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_13500_110.diff b/diffSolutions/patch_13500_110.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
++++ C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
+@@ -71,2 +71,2 @@
+-	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException {
+-		return solve(min, max);
++	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException { 		return solve(f, min, max);
++
+
diff --git a/diffSolutions/patch_135178_120.diff b/diffSolutions/patch_135178_120.diff
@@ -0,0 +1,6 @@
+--- C:\astor\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\astor\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_135670_120.diff b/diffSolutions/patch_135670_120.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_135905_416.diff b/diffSolutions/patch_135905_416.diff
@@ -0,0 +1,14 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\powerset\src\java_programs\POWERSET.java
+@@ -35,5 +35,5 @@
+-			return output;
+-		} else {
+-			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>();
+-			empty_set.add(new java.util.ArrayList());
+-			return empty_set;
++
++
++
++
++			return rest_subsets;} else { 			java.util.ArrayList empty_set = new java.util.ArrayList<java.util.ArrayList>(); 			empty_set.add(new java.util.ArrayList()); 			return empty_set;
+
diff --git a/diffSolutions/patch_13659_110.diff b/diffSolutions/patch_13659_110.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
++++ C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
+@@ -71,2 +71,2 @@
+-	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException {
+-		return solve(min, max);
++	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException { 		return solve(f, min, max);
++
+
diff --git a/diffSolutions/patch_136690_122.diff b/diffSolutions/patch_136690_122.diff
@@ -0,0 +1,6 @@
+--- C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\Users\Lenovo\Desktop\UPC\TFG_Clone\astorTFGFork\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_13671_110.diff b/diffSolutions/patch_13671_110.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
++++ C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
+@@ -71,2 +71,2 @@
+-	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException {
+-		return solve(min, max);
++	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException { 		return solve(f, min, max);
++
+
diff --git a/diffSolutions/patch_13684_110.diff b/diffSolutions/patch_13684_110.diff
@@ -0,0 +1,8 @@
+--- C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
++++ C:\astor\examples\math_70\src\main\java\org\apache\commons\math\analysis\solvers\BisectionSolver.java
+@@ -71,2 +71,2 @@
+-	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException {
+-		return solve(min, max);
++	 */ 	public double solve(final org.apache.commons.math.analysis.UnivariateRealFunction f, double min, double max, double initial) throws org.apache.commons.math.MaxIterationsExceededException, org.apache.commons.math.FunctionEvaluationException { 		return solve(f, min, max);
++
+
diff --git a/diffSolutions/patch_136874_122.diff b/diffSolutions/patch_136874_122.diff
@@ -0,0 +1,6 @@
+--- C:\astor\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\astor\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17 +17 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
++			return java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+
diff --git a/diffSolutions/patch_1370_4.diff b/diffSolutions/patch_1370_4.diff
@@ -0,0 +1,6 @@
+--- C:\astor\examples\quixbugscompiled\depth_first_search\src\java_programs\DEPTH_FIRST_SEARCH.java
++++ C:\astor\examples\quixbugscompiled\depth_first_search\src\java_programs\DEPTH_FIRST_SEARCH.java
+@@ -23 +23 @@
+-						if (search(successornodes)) { 							return true;}
++						if (node == node) { 							return true;}
+
diff --git a/diffSolutions/patch_137129_388.diff b/diffSolutions/patch_137129_388.diff
@@ -0,0 +1,14 @@
+--- C:\astor\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
++++ C:\astor\examples\quixbugscompiled\levenshtein\src\java_programs\LEVENSHTEIN.java
+@@ -17,5 +17,5 @@
+-			return 1 + java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1));
+-		} else {
+-			return 1 + java.lang.Math.min(java.lang.Math.min(
+-			java_programs.LEVENSHTEIN.levenshtein(source, target.substring(1)), 
+-			java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1))), 
++			return 
++
++			java.lang.Math.min(
++			java_programs.LEVENSHTEIN.levenshtein(target, source.substring(1)), 
++			java_programs.LEVENSHTEIN.levenshtein(target.substring(1), source.substring(1)));} else { 			return 1 + java.lang.Math.min(java.lang.Math.min(java_programs.LEVENSHTEIN.levenshtein(source, target.substring(1)), java_programs.LEVENSHTEIN.levenshtein(source.substring(1), target.substring(1))), 
+