Querying fails for very simple BDDs.
Issue #827
new
I will soon disable a test which fails because querying takes infinitely long (very simple BDDs)
Output (with stdoptions.verbosity.query=3) is:
Query-BDD:
Reaches<ct>(x[city],y[city])
FALSE BRANCH:
false
TRUE BRANCH:
true
Query-Generator:
generate values for: enumerating table()
then for each such instantiation true
Query-BDD:
Reaches<ct>(var1197[city],var1198[city])
FALSE BRANCH:
Reaches<cf>(var1197[city],var1198[city])
FALSE BRANCH:
true
TRUE BRANCH:
false
TRUE BRANCH:
false
Query-Generator:
generate values for: Inverse instance generator: inverse of
{}(0x7f8c48786770(in), 0x7f8c4873e160(in))
then for each such instantiation generate values for: Inverse instance generator: inverse of
{}(0x7f8c48786770(in), 0x7f8c4873e160(in))
then for each such instantiation true
Query-BDD:
Reaches<cf>(x[city],y[city])
FALSE BRANCH:
false
TRUE BRANCH:
true
Query-Generator:
generate values for: enumerating table()
then for each such instantiation true
Comments (5)
-
reporter -
reporter -
assigned issue to
-
assigned issue to
-
-
Is not a BDD issue, grounding and propagation still fast. Solver takes a long time. Looks like solver gets "lost".
-
-
assigned issue to
Seems to be solverrelated?
-
assigned issue to
- Log in to comment
Disabled test
See #827
→ <<cset bf804f2d762e>>