@@ -87,6 +87,7 @@ public void testMustTransformers(SolverHistory<ADDTransformer<String, String>, S
8787 Assert .assertNotEquals (aPT , bPT );
8888
8989 for (int i = 0 ; i < Math .pow (2 , numSubformulas ); i ++) {
90+ String errMsg = "Failure in system: " + i ;
9091 String binaryString = String .format ("%05d" , Integer .parseInt (Integer .toBinaryString (i )));
9192 boolean [] input = new boolean [numSubformulas ];
9293 input [0 ] = binaryString .charAt (0 ) == '1' ;
@@ -99,22 +100,22 @@ public void testMustTransformers(SolverHistory<ADDTransformer<String, String>, S
99100 for (int j = 0 ; j < numSubformulas ; j ++) {
100101 aResult [j ] = aSatVarNumbers .get (j );
101102 }
102- Assert .assertEquals (aResult [4 ], input [0 ]);
103- Assert .assertFalse (aResult [0 ]);
104- Assert .assertFalse (aResult [1 ]);
105- Assert .assertFalse (aResult [2 ]);
106- Assert .assertFalse (aResult [3 ]);
103+ Assert .assertEquals (aResult [4 ], input [0 ], errMsg );
104+ Assert .assertFalse (aResult [0 ], errMsg );
105+ Assert .assertFalse (aResult [1 ], errMsg );
106+ Assert .assertFalse (aResult [2 ], errMsg );
107+ Assert .assertFalse (aResult [3 ], errMsg );
107108
108109 BitSet bSatVarNumbers = bPT .evaluate (input );
109110 boolean [] bResult = new boolean [numSubformulas ];
110111 for (int j = 0 ; j < numSubformulas ; j ++) {
111112 bResult [j ] = bSatVarNumbers .get (j );
112113 }
113- Assert .assertEquals (bResult [1 ], input [2 ]);
114- Assert .assertEquals (bResult [2 ], input [3 ]);
115- Assert .assertEquals (bResult [4 ], input [0 ]);
116- Assert .assertFalse (bResult [0 ]);
117- Assert .assertFalse (bResult [3 ]);
114+ Assert .assertEquals (bResult [1 ], input [2 ], errMsg );
115+ Assert .assertEquals (bResult [2 ], input [3 ], errMsg );
116+ Assert .assertEquals (bResult [4 ], input [0 ], errMsg );
117+ Assert .assertFalse (bResult [0 ], errMsg );
118+ Assert .assertFalse (bResult [3 ], errMsg );
118119 }
119120 }
120121
0 commit comments