Information Technology Reference
In-Depth Information
The set of uncovered target combinations is:
{
///////////////////////////
( 1 , 1 , - , - ) ,
///////////////////////////
( 1 , 2 , - , - ) ,
( 2 , 1 , - , - )
/////////////////////////
(2,2,-,-),
///////////////////////////
( 1 , - , 1 , - ) ,
///////////////////////////
( 1 , - , 2 , - ) ,
/////////////////////////
( 2 , - , 1 , - ) ,
///////////////////////////
(2,-,2,-),
///////////////////////////
( 1 , - , - , 1 ) ,
///////////////////////////
( 1 , - , - , 2 ) ,
/////////////////////////
( 2 , - , - , 1 ) ,
///////////////////////////
(2,-,-,2),
///////////////////////////
( - , 1 , 1 , - ) ,
( - , 1 , 2 , - ) ,
/////////////////////////
( - , 2 , 1 , - ) ,
///////////////////////////
(-,2,2,-),
( - , 1 , - , 1 ) ,
( - , 1 , - , 2 ) ,
///////////////////////////
/////////////////////////
( - , 2 , - , 1 ) ,
///////////////////////////
(-,2,-,2),
///////////////////////////
( - , - , 1 , 1 ) ,
///////////////////////////
( - , - , 1 , 2 ) ,
/////////////////////////
( - , - , 2 , 1 ) ,
/////////////////////////
(-,-,2,2)
}
.
Note that we do not check the satisfiability of target combinations, so combination
(
is still in the set of uncovered target combinations. To generate the next
test case, a PBO problem is generated:
⎧
⎨
2
,
1
,
−
,
−
)
min
:
B
,
−
,
−
)
+
B
,
−
)
+
B
(
2
,
1
(
−
,
1
,
2
(
−
,
1
,
−
,
1
)
A
)
+
A
=
1
;
(
p
1
,
1
(
p
1
,
2
)
A
)
+
A
=
1
;
(
p
2
,
1
(
p
2
,
2
)
A
)
+
A
=
1
;
(
p
3
,
1
(
p
3
,
2
)
A
)
+
A
=
1
;
(
p
4
,
1
(
p
4
,
2
)
−
B
,
−
,
−
)
+
A
≥
0
;
(
2
,
1
(
p
1
,
2
)
−
B
,
−
,
−
)
+
A
≥
0
;
(
2
,
1
(
p
2
,
1
)
−
A
)
−
A
)
+
B
≥−
1
;
(
p
1
,
2
(
p
2
,
1
(
2
,
1
,
−
,
−
)
⎩
−
B
,
−
)
+
A
≥
0
;
(
−
,
1
,
2
(
p
2
,
1
)
−
B
,
−
)
+
A
≥
0
;
(
−
,
1
,
2
(
p
3
,
2
)
−
A
(
p
2
,
1
)
−
A
(
p
3
,
2
)
+
B
(
−
,
1
,
2
,
−
)
≥−
1
;
−
B
(
−
,
1
,
−
,
1
)
+
A
(
p
2
,
1
)
≥
0
;
−
B
(
−
,
1
,
−
,
1
)
+
A
(
p
4
,
1
)
≥
0
;
−
A
(
p
2
,
2
)
−
A
(
p
4
,
1
)
+
B
(
−
,
1
,
−
,
1
)
≥−
1
;
−
A
(
p
1
,
2
)
−
A
(
p
2
,
1
)
≥−
1
;
Note that the last PB constraint is translated from constraint “
p
2
=
1
→
p
1
=
1”,
which forbids combination
.
The PBO problem is solved by the solver, and the solution is
(
2
,
1
,
−
,
−
)
.We
accept this test case as the fifth test case, and update the set of uncovered target
combinations, which now becomes:
(
1
,
1
,
2
,
1
)
{
///////////////////////////
( 1 , 1 , - , - ) ,
///////////////////////////
( 1 , 2 , - , - ) ,
( 2 , 1 , - , - )
/////////////////////////
(2,2,-,-),
///////////////////////////
( 1 , - , 1 , - ) ,
///////////////////////////
( 1 , - , 2 , - ) ,
/////////////////////////
( 2 , - , 1 , - ) ,
///////////////////////////
(2,-,2,-),
///////////////////////////
( 1 , - , - , 1 ) ,
///////////////////////////
( 1 , - , - , 2 ) ,
/////////////////////////
( 2 , - , - , 1 ) ,
///////////////////////////
(2,-,-,2),
///////////////////////////
( - , 1 , 1 , - ) ,
///////////////////////////
( - , 1 , 2 , - ) ,
/////////////////////////
( - , 2 , 1 , - ) ,
///////////////////////////
(-,2,2,-),
///////////////////////////
( - , 1 , - , 1 ) ,
///////////////////////////
( - , 1 , - , 2 ) ,
/////////////////////////
( - , 2 , - , 1 ) ,
///////////////////////////
(-,2,-,2),
///////////////////////////
( - , - , 1 , 1 ) ,
///////////////////////////
( - , - , 1 , 2 ) ,
/////////////////////////
( - , - , 2 , 1 ) ,
/////////////////////////
(-,-,2,2)
}
.
After this, a similar process is conducted, and the solution covers no new target
combinations, so the test generation terminates and the remaining target combination
(
2
,
1
,
−
,
−
)
is unsatisfiable. The complete test suite is as shown in Table
3.7
.
Search WWH ::
Custom Search